./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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.bakery.4.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 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:26:28,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:26:28,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 06:26:28,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:26:28,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:26:28,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:26:28,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:26:28,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:26:28,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:26:28,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:26:28,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:26:28,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:26:28,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:26:28,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:26:28,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:26:28,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:26:28,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:26:28,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:26:28,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:26:28,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:26:28,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:26:28,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:26:28,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:26:28,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:26:28,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:26:28,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:26:28,672 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 -> 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 [2025-01-09 06:26:28,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:26:28,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:26:28,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:26:28,876 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:26:28,876 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:26:28,877 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.bakery.4.prop1-func-interl.c [2025-01-09 06:26:30,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f6f1a1af/52aabdcddeba482188f99e5d2cac3dde/FLAG8aa1e9a3a [2025-01-09 06:26:30,353 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:26:30,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-01-09 06:26:30,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f6f1a1af/52aabdcddeba482188f99e5d2cac3dde/FLAG8aa1e9a3a [2025-01-09 06:26:30,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f6f1a1af/52aabdcddeba482188f99e5d2cac3dde [2025-01-09 06:26:30,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:26:30,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:26:30,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:26:30,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:26:30,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:26:30,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:26:30" (1/1) ... [2025-01-09 06:26:30,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674a009b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:30, skipping insertion in model container [2025-01-09 06:26:30,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:26:30" (1/1) ... [2025-01-09 06:26:30,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:26:30,799 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.bakery.4.prop1-func-interl.c[1173,1186] [2025-01-09 06:26:31,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:26:31,104 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:26:31,112 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.bakery.4.prop1-func-interl.c[1173,1186] [2025-01-09 06:26:31,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:26:31,290 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:26:31,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31 WrapperNode [2025-01-09 06:26:31,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:26:31,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:26:31,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:26:31,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:26:31,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:31,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:31,777 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5233 [2025-01-09 06:26:31,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:26:31,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:26:31,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:26:31,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:26:31,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:31,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:31,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,008 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-01-09 06:26:32,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:26:32,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:26:32,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:26:32,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:26:32,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (1/1) ... [2025-01-09 06:26:32,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:26:32,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:26:32,291 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-01-09 06:26:32,293 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-01-09 06:26:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:26:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:26:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:26:32,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:26:32,605 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:26:32,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:26:37,116 INFO L? ?]: Removed 2933 outVars from TransFormulas that were not future-live. [2025-01-09 06:26:37,116 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:26:37,148 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:26:37,148 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:26:37,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:26:37 BoogieIcfgContainer [2025-01-09 06:26:37,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:26:37,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:26:37,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:26:37,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:26:37,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:26:30" (1/3) ... [2025-01-09 06:26:37,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c8a4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:26:37, skipping insertion in model container [2025-01-09 06:26:37,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:31" (2/3) ... [2025-01-09 06:26:37,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c8a4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:26:37, skipping insertion in model container [2025-01-09 06:26:37,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:26:37" (3/3) ... [2025-01-09 06:26:37,156 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-01-09 06:26:37,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:26:37,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c that has 1 procedures, 1802 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:26:37,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:26:37,238 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;@3f080831, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:26:37,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:26:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 1802 states, 1800 states have (on average 1.4994444444444444) internal successors, (2699), 1801 states have internal predecessors, (2699), 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-01-09 06:26:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 06:26:37,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:37,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:37,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:37,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1403989345, now seen corresponding path program 1 times [2025-01-09 06:26:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:26:37,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226199735] [2025-01-09 06:26:37,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:37,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:26:37,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 06:26:37,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 06:26:37,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:37,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:26:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:26:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226199735] [2025-01-09 06:26:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226199735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:26:38,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:26:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:26:38,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371030037] [2025-01-09 06:26:38,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:26:38,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:26:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:26:38,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:26:38,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:26:38,062 INFO L87 Difference]: Start difference. First operand has 1802 states, 1800 states have (on average 1.4994444444444444) internal successors, (2699), 1801 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:26:38,211 INFO L93 Difference]: Finished difference Result 3489 states and 5229 transitions. [2025-01-09 06:26:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:26:38,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-01-09 06:26:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:26:38,233 INFO L225 Difference]: With dead ends: 3489 [2025-01-09 06:26:38,234 INFO L226 Difference]: Without dead ends: 1801 [2025-01-09 06:26:38,240 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-01-09 06:26:38,242 INFO L435 NwaCegarLoop]: 2693 mSDtfsCounter, 0 mSDsluCounter, 5380 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8073 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:26:38,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8073 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:26:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-01-09 06:26:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2025-01-09 06:26:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.4983333333333333) internal successors, (2697), 1800 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2697 transitions. [2025-01-09 06:26:38,352 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2697 transitions. Word has length 107 [2025-01-09 06:26:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:26:38,353 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2697 transitions. [2025-01-09 06:26:38,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2697 transitions. [2025-01-09 06:26:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 06:26:38,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:38,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:38,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:26:38,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -572300919, now seen corresponding path program 1 times [2025-01-09 06:26:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:26:38,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774318050] [2025-01-09 06:26:38,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:38,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:26:38,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 06:26:38,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 06:26:38,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:38,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:26:38,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:26:38,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774318050] [2025-01-09 06:26:38,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774318050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:26:38,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:26:38,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:26:38,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302769936] [2025-01-09 06:26:38,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:26:38,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:26:38,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:26:38,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:26:38,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:26:38,652 INFO L87 Difference]: Start difference. First operand 1801 states and 2697 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:26:38,720 INFO L93 Difference]: Finished difference Result 3490 states and 5227 transitions. [2025-01-09 06:26:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:26:38,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-01-09 06:26:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:26:38,731 INFO L225 Difference]: With dead ends: 3490 [2025-01-09 06:26:38,731 INFO L226 Difference]: Without dead ends: 1803 [2025-01-09 06:26:38,733 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-01-09 06:26:38,734 INFO L435 NwaCegarLoop]: 2693 mSDtfsCounter, 0 mSDsluCounter, 5376 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8069 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:26:38,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8069 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:26:38,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-01-09 06:26:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2025-01-09 06:26:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1802 states have (on average 1.497780244173141) internal successors, (2699), 1802 states have internal predecessors, (2699), 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-01-09 06:26:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2699 transitions. [2025-01-09 06:26:38,771 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2699 transitions. Word has length 108 [2025-01-09 06:26:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:26:38,772 INFO L471 AbstractCegarLoop]: Abstraction has 1803 states and 2699 transitions. [2025-01-09 06:26:38,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2699 transitions. [2025-01-09 06:26:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 06:26:38,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:38,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:38,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:26:38,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:38,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1659424584, now seen corresponding path program 1 times [2025-01-09 06:26:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:26:38,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185058170] [2025-01-09 06:26:38,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:26:38,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 06:26:38,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 06:26:38,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:38,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:26:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:26:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185058170] [2025-01-09 06:26:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185058170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:26:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:26:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:26:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567541197] [2025-01-09 06:26:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:26:38,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:26:38,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:26:38,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:26:38,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:26:38,985 INFO L87 Difference]: Start difference. First operand 1803 states and 2699 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:26:39,048 INFO L93 Difference]: Finished difference Result 3498 states and 5237 transitions. [2025-01-09 06:26:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:26:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-01-09 06:26:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:26:39,054 INFO L225 Difference]: With dead ends: 3498 [2025-01-09 06:26:39,054 INFO L226 Difference]: Without dead ends: 1809 [2025-01-09 06:26:39,056 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-01-09 06:26:39,057 INFO L435 NwaCegarLoop]: 2693 mSDtfsCounter, 4 mSDsluCounter, 5370 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8063 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:26:39,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8063 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:26:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-01-09 06:26:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2025-01-09 06:26:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4972345132743363) internal successors, (2707), 1808 states have internal predecessors, (2707), 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-01-09 06:26:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2707 transitions. [2025-01-09 06:26:39,089 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2707 transitions. Word has length 109 [2025-01-09 06:26:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:26:39,090 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2707 transitions. [2025-01-09 06:26:39,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2707 transitions. [2025-01-09 06:26:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:26:39,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:39,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:39,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:26:39,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:39,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:39,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1151503031, now seen corresponding path program 1 times [2025-01-09 06:26:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:26:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019837778] [2025-01-09 06:26:39,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:39,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:26:39,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:26:39,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:26:39,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:39,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:26:39,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:26:39,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019837778] [2025-01-09 06:26:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019837778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:26:39,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:26:39,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:26:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305824865] [2025-01-09 06:26:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:26:39,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:26:39,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:26:39,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:26:39,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:26:39,345 INFO L87 Difference]: Start difference. First operand 1809 states and 2707 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:26:39,409 INFO L93 Difference]: Finished difference Result 3508 states and 5249 transitions. [2025-01-09 06:26:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:26:39,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 06:26:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:26:39,417 INFO L225 Difference]: With dead ends: 3508 [2025-01-09 06:26:39,417 INFO L226 Difference]: Without dead ends: 1813 [2025-01-09 06:26:39,419 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-01-09 06:26:39,421 INFO L435 NwaCegarLoop]: 2693 mSDtfsCounter, 0 mSDsluCounter, 5370 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8063 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:26:39,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8063 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:26:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-01-09 06:26:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1809. [2025-01-09 06:26:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4972345132743363) internal successors, (2707), 1808 states have internal predecessors, (2707), 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-01-09 06:26:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2707 transitions. [2025-01-09 06:26:39,454 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2707 transitions. Word has length 110 [2025-01-09 06:26:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:26:39,455 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2707 transitions. [2025-01-09 06:26:39,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2707 transitions. [2025-01-09 06:26:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:26:39,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:39,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:39,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:26:39,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:39,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2049224239, now seen corresponding path program 1 times [2025-01-09 06:26:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:26:39,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803794554] [2025-01-09 06:26:39,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:39,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:26:39,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:26:39,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:26:39,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:39,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:26:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:26:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803794554] [2025-01-09 06:26:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803794554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:26:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:26:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:26:39,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114212512] [2025-01-09 06:26:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:26:39,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:26:39,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:26:39,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:26:39,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:26:39,741 INFO L87 Difference]: Start difference. First operand 1809 states and 2707 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:26:41,407 INFO L93 Difference]: Finished difference Result 5183 states and 7757 transitions. [2025-01-09 06:26:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:26:41,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-01-09 06:26:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:26:41,418 INFO L225 Difference]: With dead ends: 5183 [2025-01-09 06:26:41,419 INFO L226 Difference]: Without dead ends: 3488 [2025-01-09 06:26:41,422 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-01-09 06:26:41,422 INFO L435 NwaCegarLoop]: 2084 mSDtfsCounter, 2579 mSDsluCounter, 6118 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 8202 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:26:41,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 8202 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 06:26:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2025-01-09 06:26:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 1888. [2025-01-09 06:26:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 1.4965553789083201) internal successors, (2824), 1887 states have internal predecessors, (2824), 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-01-09 06:26:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2824 transitions. [2025-01-09 06:26:41,467 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2824 transitions. Word has length 111 [2025-01-09 06:26:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:26:41,467 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2824 transitions. [2025-01-09 06:26:41,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:26:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2824 transitions. [2025-01-09 06:26:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 06:26:41,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:41,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:41,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:26:41,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:41,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1132542867, now seen corresponding path program 1 times [2025-01-09 06:26:41,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:26:41,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260389109] [2025-01-09 06:26:41,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:41,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:26:41,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 06:26:41,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 06:26:41,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:41,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:26:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:26:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260389109] [2025-01-09 06:26:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260389109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:26:41,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:26:41,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:26:41,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779899792] [2025-01-09 06:26:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:26:41,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:26:41,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:26:41,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:26:41,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:26:41,938 INFO L87 Difference]: Start difference. First operand 1888 states and 2824 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-01-09 06:26:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:26:43,166 INFO L93 Difference]: Finished difference Result 3598 states and 5382 transitions. [2025-01-09 06:26:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:26:43,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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 112 [2025-01-09 06:26:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:26:43,172 INFO L225 Difference]: With dead ends: 3598 [2025-01-09 06:26:43,172 INFO L226 Difference]: Without dead ends: 1903 [2025-01-09 06:26:43,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:26:43,175 INFO L435 NwaCegarLoop]: 2065 mSDtfsCounter, 2612 mSDsluCounter, 6181 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 8246 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:26:43,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 8246 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 06:26:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2025-01-09 06:26:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1901. [2025-01-09 06:26:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1900 states have (on average 1.4942105263157894) internal successors, (2839), 1900 states have internal predecessors, (2839), 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-01-09 06:26:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2839 transitions. [2025-01-09 06:26:43,206 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2839 transitions. Word has length 112 [2025-01-09 06:26:43,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:26:43,206 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2839 transitions. [2025-01-09 06:26:43,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-01-09 06:26:43,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2839 transitions. [2025-01-09 06:26:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 06:26:43,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:43,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:43,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:26:43,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:43,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1638871757, now seen corresponding path program 1 times [2025-01-09 06:26:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:26:43,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208863667] [2025-01-09 06:26:43,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:43,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:26:43,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 06:26:43,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 06:26:43,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:43,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:26:43,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:26:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208863667] [2025-01-09 06:26:43,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208863667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:26:43,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:26:43,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:26:43,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715547433] [2025-01-09 06:26:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:26:43,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:26:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:26:43,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:26:43,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:26:43,408 INFO L87 Difference]: Start difference. First operand 1901 states and 2839 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-01-09 06:26:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:26:44,424 INFO L93 Difference]: Finished difference Result 3606 states and 5388 transitions. [2025-01-09 06:26:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:26:44,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 113 [2025-01-09 06:26:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:26:44,430 INFO L225 Difference]: With dead ends: 3606 [2025-01-09 06:26:44,430 INFO L226 Difference]: Without dead ends: 1901 [2025-01-09 06:26:44,432 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-01-09 06:26:44,433 INFO L435 NwaCegarLoop]: 2074 mSDtfsCounter, 2592 mSDsluCounter, 4137 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2592 SdHoareTripleChecker+Valid, 6211 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:26:44,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2592 Valid, 6211 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 06:26:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-01-09 06:26:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1888. [2025-01-09 06:26:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 1.494435612082671) internal successors, (2820), 1887 states have internal predecessors, (2820), 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-01-09 06:26:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2820 transitions. [2025-01-09 06:26:44,465 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2820 transitions. Word has length 113 [2025-01-09 06:26:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:26:44,465 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2820 transitions. [2025-01-09 06:26:44,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-01-09 06:26:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2820 transitions. [2025-01-09 06:26:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 06:26:44,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:44,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:44,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:26:44,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:44,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1068437458, now seen corresponding path program 1 times [2025-01-09 06:26:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:26:44,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5134828] [2025-01-09 06:26:44,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:26:44,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 06:26:44,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 06:26:44,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:44,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:26:44,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 06:26:44,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 06:26:44,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 06:26:44,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:44,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:26:44,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 06:26:44,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 06:26:44,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 06:26:44,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:26:44,634 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:44,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 06:26:44,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:26:44 BoogieIcfgContainer [2025-01-09 06:26:44,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 06:26:44,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 06:26:44,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 06:26:44,693 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 06:26:44,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:26:37" (3/4) ... [2025-01-09 06:26:44,696 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 06:26:44,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 06:26:44,703 INFO L158 Benchmark]: Toolchain (without parser) took 14094.97ms. Allocated memory was 142.6MB in the beginning and 998.2MB in the end (delta: 855.6MB). Free memory was 103.5MB in the beginning and 735.7MB in the end (delta: -632.2MB). Peak memory consumption was 225.6MB. Max. memory is 16.1GB. [2025-01-09 06:26:44,703 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:26:44,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.84ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 84.7MB in the end (delta: 17.9MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2025-01-09 06:26:44,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 485.02ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 84.7MB in the beginning and 226.1MB in the end (delta: -141.4MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. [2025-01-09 06:26:44,704 INFO L158 Benchmark]: Boogie Preprocessor took 478.30ms. Allocated memory is still 369.1MB. Free memory was 226.1MB in the beginning and 190.1MB in the end (delta: 35.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 06:26:44,704 INFO L158 Benchmark]: RCFGBuilder took 4889.98ms. Allocated memory was 369.1MB in the beginning and 998.2MB in the end (delta: 629.1MB). Free memory was 190.1MB in the beginning and 402.4MB in the end (delta: -212.3MB). Peak memory consumption was 455.5MB. Max. memory is 16.1GB. [2025-01-09 06:26:44,704 INFO L158 Benchmark]: TraceAbstraction took 7541.73ms. Allocated memory is still 998.2MB. Free memory was 402.4MB in the beginning and 735.8MB in the end (delta: -333.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:26:44,704 INFO L158 Benchmark]: Witness Printer took 9.63ms. Allocated memory is still 998.2MB. Free memory was 735.8MB in the beginning and 735.7MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:26:44,705 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.25ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.84ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 84.7MB in the end (delta: 17.9MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 485.02ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 84.7MB in the beginning and 226.1MB in the end (delta: -141.4MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 478.30ms. Allocated memory is still 369.1MB. Free memory was 226.1MB in the beginning and 190.1MB in the end (delta: 35.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * RCFGBuilder took 4889.98ms. Allocated memory was 369.1MB in the beginning and 998.2MB in the end (delta: 629.1MB). Free memory was 190.1MB in the beginning and 402.4MB in the end (delta: -212.3MB). Peak memory consumption was 455.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7541.73ms. Allocated memory is still 998.2MB. Free memory was 402.4MB in the beginning and 735.8MB in the end (delta: -333.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 9.63ms. Allocated memory is still 998.2MB. Free memory was 735.8MB in the beginning and 735.7MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 229, overapproximation of bitwiseAnd at line 231. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_4 var_63 = 1; [L41] const SORT_4 var_64 = 0; [L42] const SORT_2 var_74 = 0; [L43] const SORT_2 var_76 = 1; [L44] const SORT_3 var_91 = 0; [L45] const SORT_4 var_227 = 3; [L46] const SORT_2 var_239 = 3; [L47] const SORT_4 var_241 = 6; [L48] const SORT_4 var_343 = 2; [L50] SORT_1 input_73; [L51] SORT_1 input_75; [L52] SORT_1 input_80; [L53] SORT_1 input_81; [L54] SORT_1 input_85; [L55] SORT_1 input_86; [L56] SORT_1 input_90; [L57] SORT_1 input_98; [L58] SORT_1 input_105; [L59] SORT_1 input_112; [L60] SORT_1 input_116; [L61] SORT_1 input_117; [L62] SORT_1 input_131; [L63] SORT_1 input_135; [L64] SORT_1 input_136; [L65] SORT_1 input_150; [L66] SORT_1 input_154; [L67] SORT_1 input_155; [L68] SORT_1 input_176; [L69] SORT_1 input_179; [L70] SORT_1 input_195; [L71] SORT_1 input_198; [L72] SORT_1 input_214; [L73] SORT_1 input_217; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L75] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L76] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L77] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L78] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L79] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L80] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L81] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L82] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L83] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L84] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L85] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L86] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L87] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L88] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L89] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L90] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L91] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L92] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L93] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L94] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L95] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L96] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L97] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L98] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L99] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L100] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L101] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L102] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] SORT_2 init_7_arg_1 = var_5; [L105] state_6 = init_7_arg_1 [L106] SORT_2 init_9_arg_1 = var_5; [L107] state_8 = init_9_arg_1 [L108] SORT_2 init_11_arg_1 = var_5; [L109] state_10 = init_11_arg_1 [L110] SORT_2 init_13_arg_1 = var_5; [L111] state_12 = init_13_arg_1 [L112] SORT_2 init_15_arg_1 = var_5; [L113] state_14 = init_15_arg_1 [L114] SORT_2 init_17_arg_1 = var_5; [L115] state_16 = init_17_arg_1 [L116] SORT_2 init_19_arg_1 = var_5; [L117] state_18 = init_19_arg_1 [L118] SORT_2 init_21_arg_1 = var_5; [L119] state_20 = init_21_arg_1 [L120] SORT_2 init_23_arg_1 = var_5; [L121] state_22 = init_23_arg_1 [L122] SORT_2 init_25_arg_1 = var_5; [L123] state_24 = init_25_arg_1 [L124] SORT_2 init_27_arg_1 = var_5; [L125] state_26 = init_27_arg_1 [L126] SORT_2 init_29_arg_1 = var_5; [L127] state_28 = init_29_arg_1 [L128] SORT_1 init_32_arg_1 = var_30; [L129] state_31 = init_32_arg_1 [L130] SORT_1 init_34_arg_1 = var_30; [L131] state_33 = init_34_arg_1 [L132] SORT_1 init_36_arg_1 = var_30; [L133] state_35 = init_36_arg_1 [L134] SORT_1 init_38_arg_1 = var_30; [L135] state_37 = init_38_arg_1 [L136] SORT_1 init_40_arg_1 = var_30; [L137] state_39 = init_40_arg_1 [L138] SORT_1 init_42_arg_1 = var_30; [L139] state_41 = init_42_arg_1 [L140] SORT_1 init_44_arg_1 = var_30; [L141] state_43 = init_44_arg_1 [L142] SORT_1 init_46_arg_1 = var_30; [L143] state_45 = init_46_arg_1 [L144] SORT_1 init_48_arg_1 = var_30; [L145] state_47 = init_48_arg_1 [L146] SORT_1 init_50_arg_1 = var_30; [L147] state_49 = init_50_arg_1 [L148] SORT_1 init_52_arg_1 = var_30; [L149] state_51 = init_52_arg_1 [L150] SORT_1 init_54_arg_1 = var_30; [L151] state_53 = init_54_arg_1 [L152] SORT_1 init_56_arg_1 = var_30; [L153] state_55 = init_56_arg_1 [L154] SORT_1 init_58_arg_1 = var_30; [L155] state_57 = init_58_arg_1 [L156] SORT_1 init_60_arg_1 = var_30; [L157] state_59 = init_60_arg_1 [L158] SORT_1 init_62_arg_1 = var_30; [L159] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L162] input_73 = __VERIFIER_nondet_uchar() [L163] EXPR input_73 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L163] input_73 = input_73 & mask_SORT_1 [L164] input_75 = __VERIFIER_nondet_uchar() [L165] EXPR input_75 & mask_SORT_1 VAL [input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L165] input_75 = input_75 & mask_SORT_1 [L166] input_80 = __VERIFIER_nondet_uchar() [L167] EXPR input_80 & mask_SORT_1 VAL [input_73=0, input_75=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L167] input_80 = input_80 & mask_SORT_1 [L168] input_81 = __VERIFIER_nondet_uchar() [L169] EXPR input_81 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L169] input_81 = input_81 & mask_SORT_1 [L170] input_85 = __VERIFIER_nondet_uchar() [L171] EXPR input_85 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L171] input_85 = input_85 & mask_SORT_1 [L172] input_86 = __VERIFIER_nondet_uchar() [L173] EXPR input_86 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L173] input_86 = input_86 & mask_SORT_1 [L174] input_90 = __VERIFIER_nondet_uchar() [L175] EXPR input_90 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L175] input_90 = input_90 & mask_SORT_1 [L176] input_98 = __VERIFIER_nondet_uchar() [L177] EXPR input_98 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L177] input_98 = input_98 & mask_SORT_1 [L178] input_105 = __VERIFIER_nondet_uchar() [L179] EXPR input_105 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L179] input_105 = input_105 & mask_SORT_1 [L180] input_112 = __VERIFIER_nondet_uchar() [L181] EXPR input_112 & mask_SORT_1 VAL [input_105=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L181] input_112 = input_112 & mask_SORT_1 [L182] input_116 = __VERIFIER_nondet_uchar() [L183] EXPR input_116 & mask_SORT_1 VAL [input_105=0, input_112=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L183] input_116 = input_116 & mask_SORT_1 [L184] input_117 = __VERIFIER_nondet_uchar() [L185] EXPR input_117 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L185] input_117 = input_117 & mask_SORT_1 [L186] input_131 = __VERIFIER_nondet_uchar() [L187] EXPR input_131 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L187] input_131 = input_131 & mask_SORT_1 [L188] input_135 = __VERIFIER_nondet_uchar() [L189] EXPR input_135 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L189] input_135 = input_135 & mask_SORT_1 [L190] input_136 = __VERIFIER_nondet_uchar() [L191] EXPR input_136 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L191] input_136 = input_136 & mask_SORT_1 [L192] input_150 = __VERIFIER_nondet_uchar() [L193] EXPR input_150 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L193] input_150 = input_150 & mask_SORT_1 [L194] input_154 = __VERIFIER_nondet_uchar() [L195] EXPR input_154 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L195] input_154 = input_154 & mask_SORT_1 [L196] input_155 = __VERIFIER_nondet_uchar() [L197] EXPR input_155 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L197] input_155 = input_155 & mask_SORT_1 [L198] input_176 = __VERIFIER_nondet_uchar() [L199] input_179 = __VERIFIER_nondet_uchar() [L200] input_195 = __VERIFIER_nondet_uchar() [L201] input_198 = __VERIFIER_nondet_uchar() [L202] input_214 = __VERIFIER_nondet_uchar() [L203] input_217 = __VERIFIER_nondet_uchar() [L206] SORT_1 var_65_arg_0 = state_39; [L207] SORT_4 var_65_arg_1 = var_63; [L208] SORT_4 var_65_arg_2 = var_64; [L209] SORT_4 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L210] SORT_1 var_66_arg_0 = state_49; [L211] SORT_4 var_66_arg_1 = var_63; [L212] SORT_4 var_66_arg_2 = var_64; [L213] SORT_4 var_66 = var_66_arg_0 ? var_66_arg_1 : var_66_arg_2; [L214] SORT_4 var_67_arg_0 = var_65; [L215] SORT_4 var_67_arg_1 = var_66; [L216] SORT_4 var_67 = var_67_arg_0 + var_67_arg_1; [L217] SORT_1 var_68_arg_0 = state_59; [L218] SORT_4 var_68_arg_1 = var_63; [L219] SORT_4 var_68_arg_2 = var_64; [L220] SORT_4 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L221] SORT_4 var_69_arg_0 = var_67; [L222] SORT_4 var_69_arg_1 = var_68; [L223] SORT_4 var_69 = var_69_arg_0 + var_69_arg_1; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_69=0, var_74=0, var_76=1, var_91=0] [L224] EXPR var_69 & mask_SORT_4 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L224] var_69 = var_69 & mask_SORT_4 [L225] SORT_4 var_70_arg_0 = var_69; [L226] SORT_4 var_70_arg_1 = var_63; [L227] SORT_1 var_70 = var_70_arg_0 <= var_70_arg_1; [L228] SORT_1 var_71_arg_0 = ~state_61; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_70=1, var_71_arg_0=-1, var_74=0, var_76=1, var_91=0] [L229] EXPR var_71_arg_0 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_70=1, var_74=0, var_76=1, var_91=0] [L229] var_71_arg_0 = var_71_arg_0 & mask_SORT_1 [L230] SORT_1 var_71_arg_1 = ~var_70; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_71_arg_1=-2, var_74=0, var_76=1, var_91=0] [L231] EXPR var_71_arg_1 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_74=0, var_76=1, var_91=0] [L231] var_71_arg_1 = var_71_arg_1 & mask_SORT_1 [L232] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L232] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L233] EXPR var_71 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L233] var_71 = var_71 & mask_SORT_1 [L234] SORT_1 bad_72_arg_0 = var_71; [L235] CALL __VERIFIER_assert(!(bad_72_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1802 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7787 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7787 mSDsluCounter, 54927 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37932 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6870 IncrementalHoareTripleChecker+Invalid, 6874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 16995 mSDtfsCounter, 6870 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1901occurred in iteration=6, InterpolantAutomatonStates: 32, 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, 7 MinimizatonAttempts, 1619 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 883 NumberOfCodeBlocks, 883 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 763 ConstructedInterpolants, 0 QuantifiedInterpolants, 2235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-01-09 06:26:44,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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.bakery.4.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 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:26:47,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:26:47,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 06:26:47,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:26:47,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:26:47,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:26:47,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:26:47,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:26:47,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:26:47,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:26:47,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:26:47,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:26:47,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 06:26:47,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:26:47,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:26:47,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:26:47,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:26:47,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:26:47,337 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:26:47,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:26:47,338 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 06:26:47,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 06:26:47,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:26:47,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:26:47,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:26:47,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:26:47,338 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 -> 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 [2025-01-09 06:26:47,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:26:47,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:26:47,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:26:47,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:26:47,603 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:26:47,604 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.bakery.4.prop1-func-interl.c [2025-01-09 06:26:48,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fd4009ae/2751761fc79344399bb6cee5ed5f5e8e/FLAG18988a9a2 [2025-01-09 06:26:49,121 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:26:49,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-01-09 06:26:49,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fd4009ae/2751761fc79344399bb6cee5ed5f5e8e/FLAG18988a9a2 [2025-01-09 06:26:49,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fd4009ae/2751761fc79344399bb6cee5ed5f5e8e [2025-01-09 06:26:49,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:26:49,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:26:49,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:26:49,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:26:49,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:26:49,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:49,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acf4b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49, skipping insertion in model container [2025-01-09 06:26:49,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:49,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:26:49,607 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.bakery.4.prop1-func-interl.c[1173,1186] [2025-01-09 06:26:49,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:26:49,839 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:26:49,846 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.bakery.4.prop1-func-interl.c[1173,1186] [2025-01-09 06:26:49,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:26:49,951 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:26:49,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49 WrapperNode [2025-01-09 06:26:49,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:26:49,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:26:49,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:26:49,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:26:49,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:49,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,075 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1649 [2025-01-09 06:26:50,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:26:50,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:26:50,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:26:50,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:26:50,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,139 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-01-09 06:26:50,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,166 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:26:50,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:26:50,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:26:50,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:26:50,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (1/1) ... [2025-01-09 06:26:50,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:26:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:26:50,244 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-01-09 06:26:50,248 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-01-09 06:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:26:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 06:26:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:26:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:26:50,556 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:26:50,557 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:26:51,697 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-01-09 06:26:51,697 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:26:51,703 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:26:51,704 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:26:51,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:26:51 BoogieIcfgContainer [2025-01-09 06:26:51,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:26:51,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:26:51,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:26:51,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:26:51,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:26:49" (1/3) ... [2025-01-09 06:26:51,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a41389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:26:51, skipping insertion in model container [2025-01-09 06:26:51,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:26:49" (2/3) ... [2025-01-09 06:26:51,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a41389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:26:51, skipping insertion in model container [2025-01-09 06:26:51,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:26:51" (3/3) ... [2025-01-09 06:26:51,712 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-01-09 06:26:51,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:26:51,723 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:26:51,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:26:51,776 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;@1a719a2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:26:51,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:26:51,779 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-01-09 06:26:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 06:26:51,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:51,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 06:26:51,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:51,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 06:26:51,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:26:51,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518230098] [2025-01-09 06:26:51,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:51,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:26:51,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:26:51,801 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-01-09 06:26:51,805 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-01-09 06:26:52,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 06:26:52,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 06:26:52,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:52,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:52,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 06:26:52,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:26:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:26:52,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:26:52,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 06:26:52,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518230098] [2025-01-09 06:26:52,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518230098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:26:52,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:26:52,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:26:52,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468320882] [2025-01-09 06:26:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:26:52,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:26:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 06:26:52,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:26:52,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:26:52,327 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-01-09 06:26:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:26:52,443 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 06:26:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:26:52,445 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-01-09 06:26:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:26:52,450 INFO L225 Difference]: With dead ends: 18 [2025-01-09 06:26:52,450 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 06:26:52,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:26:52,454 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:26:52,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:26:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 06:26:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 06:26:52,470 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-01-09 06:26:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 06:26:52,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 06:26:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:26:52,473 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 06:26:52,473 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-01-09 06:26:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 06:26:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 06:26:52,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:26:52,474 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 06:26:52,481 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-01-09 06:26:52,674 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-01-09 06:26:52,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:26:52,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:26:52,675 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 06:26:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:26:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696272497] [2025-01-09 06:26:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:26:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:26:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:26:52,681 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-01-09 06:26:52,682 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-01-09 06:26:53,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 06:26:53,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 06:26:53,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:26:53,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:26:53,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 06:26:53,115 INFO L279 TraceCheckSpWp]: Computing forward predicates...