./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 962be9cd8b592d9cbf1ca24e2eb1efd6754550bace2271743b15f2e4c8026f80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:49:58,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:49:58,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:49:58,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:49:58,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:49:58,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:49:58,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:49:58,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:49:58,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:49:58,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:49:58,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:49:58,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:49:58,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:49:58,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:49:58,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:49:58,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:49:58,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:49:58,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:49:58,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:49:58,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:49:58,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:49:58,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:49:58,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:49:58,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:49:58,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:49:58,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:49:58,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:49:58,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:49:58,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:49:58,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:49:58,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:49:58,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:49:58,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 962be9cd8b592d9cbf1ca24e2eb1efd6754550bace2271743b15f2e4c8026f80 [2025-03-03 17:49:58,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:49:58,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:49:58,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:49:58,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:49:58,687 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:49:58,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c [2025-03-03 17:49:59,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6054dec/d1057bff608945ee91a7bc7bd2a305a7/FLAG9e989ea34 [2025-03-03 17:50:00,178 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:50:00,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c [2025-03-03 17:50:00,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6054dec/d1057bff608945ee91a7bc7bd2a305a7/FLAG9e989ea34 [2025-03-03 17:50:00,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6054dec/d1057bff608945ee91a7bc7bd2a305a7 [2025-03-03 17:50:00,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:50:00,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:50:00,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:50:00,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:50:00,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:50:00,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:00,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00, skipping insertion in model container [2025-03-03 17:50:00,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:00,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:50:00,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c[1170,1183] [2025-03-03 17:50:00,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:50:00,825 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:50:00,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c[1170,1183] [2025-03-03 17:50:00,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:50:00,988 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:50:00,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00 WrapperNode [2025-03-03 17:50:00,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:50:00,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:50:00,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:50:00,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:50:00,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:01,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:01,603 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 7903 [2025-03-03 17:50:01,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:50:01,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:50:01,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:50:01,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:50:01,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:01,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:01,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:01,887 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:50:01,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:01,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:02,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:02,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:02,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:02,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:02,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:50:02,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:50:02,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:50:02,220 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:50:02,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (1/1) ... [2025-03-03 17:50:02,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:50:02,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:50:02,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:50:02,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:50:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:50:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:50:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:50:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:50:02,587 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:50:02,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:50:09,398 INFO L? ?]: Removed 4470 outVars from TransFormulas that were not future-live. [2025-03-03 17:50:09,398 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:50:09,731 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:50:09,735 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:50:09,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:50:09 BoogieIcfgContainer [2025-03-03 17:50:09,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:50:09,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:50:09,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:50:09,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:50:09,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:50:00" (1/3) ... [2025-03-03 17:50:09,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b63a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:50:09, skipping insertion in model container [2025-03-03 17:50:09,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:00" (2/3) ... [2025-03-03 17:50:09,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b63a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:50:09, skipping insertion in model container [2025-03-03 17:50:09,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:50:09" (3/3) ... [2025-03-03 17:50:09,747 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mcs.1.prop1-func-interl.c [2025-03-03 17:50:09,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:50:09,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mcs.1.prop1-func-interl.c that has 1 procedures, 2786 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:50:09,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:50:09,840 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;@27b9fd66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:50:09,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:50:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 2786 states, 2784 states have (on average 1.5010775862068966) internal successors, (4179), 2785 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 17:50:09,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:09,855 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:09,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:09,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash -94853732, now seen corresponding path program 1 times [2025-03-03 17:50:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:50:09,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30293736] [2025-03-03 17:50:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:50:09,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 17:50:10,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 17:50:10,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:10,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:50:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:50:10,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:50:10,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30293736] [2025-03-03 17:50:10,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30293736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:50:10,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:50:10,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:50:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478823275] [2025-03-03 17:50:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:50:10,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:50:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:50:10,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:50:10,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:50:10,711 INFO L87 Difference]: Start difference. First operand has 2786 states, 2784 states have (on average 1.5010775862068966) internal successors, (4179), 2785 states have internal predecessors, (4179), 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 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:50:14,057 INFO L93 Difference]: Finished difference Result 8008 states and 12019 transitions. [2025-03-03 17:50:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:50:14,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 121 [2025-03-03 17:50:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:50:14,092 INFO L225 Difference]: With dead ends: 8008 [2025-03-03 17:50:14,092 INFO L226 Difference]: Without dead ends: 5388 [2025-03-03 17:50:14,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:50:14,106 INFO L435 NwaCegarLoop]: 2766 mSDtfsCounter, 4046 mSDsluCounter, 8178 mSDsCounter, 0 mSdLazyCounter, 5509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4046 SdHoareTripleChecker+Valid, 10944 SdHoareTripleChecker+Invalid, 5510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:50:14,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4046 Valid, 10944 Invalid, 5510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5509 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 17:50:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5388 states. [2025-03-03 17:50:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5388 to 2838. [2025-03-03 17:50:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2838 states, 2837 states have (on average 1.5001762425096934) internal successors, (4256), 2837 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 4256 transitions. [2025-03-03 17:50:14,253 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 4256 transitions. Word has length 121 [2025-03-03 17:50:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:50:14,254 INFO L471 AbstractCegarLoop]: Abstraction has 2838 states and 4256 transitions. [2025-03-03 17:50:14,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 4256 transitions. [2025-03-03 17:50:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 17:50:14,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:14,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:14,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:50:14,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:14,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:14,258 INFO L85 PathProgramCache]: Analyzing trace with hash 675732884, now seen corresponding path program 1 times [2025-03-03 17:50:14,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:50:14,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895778440] [2025-03-03 17:50:14,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:50:14,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 17:50:14,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 17:50:14,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:14,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:50:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:50:14,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:50:14,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895778440] [2025-03-03 17:50:14,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895778440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:50:14,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:50:14,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:50:14,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789193702] [2025-03-03 17:50:14,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:50:14,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:50:14,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:50:14,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:50:14,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:50:14,591 INFO L87 Difference]: Start difference. First operand 2838 states and 4256 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:50:15,539 INFO L93 Difference]: Finished difference Result 2842 states and 4260 transitions. [2025-03-03 17:50:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:50:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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 123 [2025-03-03 17:50:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:50:15,549 INFO L225 Difference]: With dead ends: 2842 [2025-03-03 17:50:15,549 INFO L226 Difference]: Without dead ends: 2840 [2025-03-03 17:50:15,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:50:15,551 INFO L435 NwaCegarLoop]: 3481 mSDtfsCounter, 0 mSDsluCounter, 6957 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10438 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 17:50:15,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10438 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 17:50:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2025-03-03 17:50:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2840. [2025-03-03 17:50:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2839 states have (on average 1.4998238816484677) internal successors, (4258), 2839 states have internal predecessors, (4258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 4258 transitions. [2025-03-03 17:50:15,597 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 4258 transitions. Word has length 123 [2025-03-03 17:50:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:50:15,598 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 4258 transitions. [2025-03-03 17:50:15,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4258 transitions. [2025-03-03 17:50:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 17:50:15,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:15,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:15,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:50:15,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:15,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:15,603 INFO L85 PathProgramCache]: Analyzing trace with hash -522433477, now seen corresponding path program 1 times [2025-03-03 17:50:15,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:50:15,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673239505] [2025-03-03 17:50:15,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:15,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:50:15,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 17:50:15,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 17:50:15,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:15,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:50:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:50:15,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:50:15,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673239505] [2025-03-03 17:50:15,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673239505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:50:15,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:50:15,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:50:15,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127262665] [2025-03-03 17:50:15,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:50:15,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:50:15,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:50:15,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:50:15,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:50:15,867 INFO L87 Difference]: Start difference. First operand 2840 states and 4258 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:50:16,818 INFO L93 Difference]: Finished difference Result 5461 states and 8190 transitions. [2025-03-03 17:50:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:50:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 124 [2025-03-03 17:50:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:50:16,826 INFO L225 Difference]: With dead ends: 5461 [2025-03-03 17:50:16,826 INFO L226 Difference]: Without dead ends: 2842 [2025-03-03 17:50:16,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:50:16,830 INFO L435 NwaCegarLoop]: 3481 mSDtfsCounter, 0 mSDsluCounter, 6954 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10435 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 17:50:16,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10435 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 17:50:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2025-03-03 17:50:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2842. [2025-03-03 17:50:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2842 states, 2841 states have (on average 1.4994720168954594) internal successors, (4260), 2841 states have internal predecessors, (4260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 4260 transitions. [2025-03-03 17:50:16,874 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 4260 transitions. Word has length 124 [2025-03-03 17:50:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:50:16,874 INFO L471 AbstractCegarLoop]: Abstraction has 2842 states and 4260 transitions. [2025-03-03 17:50:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 4260 transitions. [2025-03-03 17:50:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 17:50:16,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:16,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:16,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:50:16,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:16,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1379022225, now seen corresponding path program 1 times [2025-03-03 17:50:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:50:16,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149174615] [2025-03-03 17:50:16,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:50:16,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 17:50:16,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 17:50:16,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:16,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:50:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:50:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:50:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149174615] [2025-03-03 17:50:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149174615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:50:17,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:50:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:50:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047958237] [2025-03-03 17:50:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:50:17,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:50:17,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:50:17,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:50:17,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:50:17,091 INFO L87 Difference]: Start difference. First operand 2842 states and 4260 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:50:18,010 INFO L93 Difference]: Finished difference Result 5465 states and 8194 transitions. [2025-03-03 17:50:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:50:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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 125 [2025-03-03 17:50:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:50:18,018 INFO L225 Difference]: With dead ends: 5465 [2025-03-03 17:50:18,019 INFO L226 Difference]: Without dead ends: 2844 [2025-03-03 17:50:18,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:50:18,022 INFO L435 NwaCegarLoop]: 3481 mSDtfsCounter, 0 mSDsluCounter, 6949 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10430 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 17:50:18,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10430 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 17:50:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2025-03-03 17:50:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2844. [2025-03-03 17:50:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 1.499120647203658) internal successors, (4262), 2843 states have internal predecessors, (4262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4262 transitions. [2025-03-03 17:50:18,058 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4262 transitions. Word has length 125 [2025-03-03 17:50:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:50:18,058 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 4262 transitions. [2025-03-03 17:50:18,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4262 transitions. [2025-03-03 17:50:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 17:50:18,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:18,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:18,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:50:18,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2088350944, now seen corresponding path program 1 times [2025-03-03 17:50:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:50:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347903407] [2025-03-03 17:50:18,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:50:18,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 17:50:18,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 17:50:18,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:18,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:50:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:50:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:50:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347903407] [2025-03-03 17:50:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347903407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:50:18,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:50:18,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:50:18,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033444643] [2025-03-03 17:50:18,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:50:18,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:50:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:50:18,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:50:18,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:50:18,640 INFO L87 Difference]: Start difference. First operand 2844 states and 4262 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:50:20,713 INFO L93 Difference]: Finished difference Result 5478 states and 8210 transitions. [2025-03-03 17:50:20,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:50:20,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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 126 [2025-03-03 17:50:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:50:20,720 INFO L225 Difference]: With dead ends: 5478 [2025-03-03 17:50:20,720 INFO L226 Difference]: Without dead ends: 2855 [2025-03-03 17:50:20,726 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-03-03 17:50:20,728 INFO L435 NwaCegarLoop]: 2756 mSDtfsCounter, 4078 mSDsluCounter, 8256 mSDsCounter, 0 mSdLazyCounter, 5687 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4078 SdHoareTripleChecker+Valid, 11012 SdHoareTripleChecker+Invalid, 5688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:50:20,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4078 Valid, 11012 Invalid, 5688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5687 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 17:50:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2025-03-03 17:50:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2854. [2025-03-03 17:50:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2853 states have (on average 1.4980722046968105) internal successors, (4274), 2853 states have internal predecessors, (4274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4274 transitions. [2025-03-03 17:50:20,768 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4274 transitions. Word has length 126 [2025-03-03 17:50:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:50:20,768 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 4274 transitions. [2025-03-03 17:50:20,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4274 transitions. [2025-03-03 17:50:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 17:50:20,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:20,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:20,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:50:20,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:20,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1028975339, now seen corresponding path program 1 times [2025-03-03 17:50:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:50:20,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23982941] [2025-03-03 17:50:20,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:50:20,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 17:50:20,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 17:50:20,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:20,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:50:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:50:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:50:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23982941] [2025-03-03 17:50:21,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23982941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:50:21,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:50:21,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:50:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560693517] [2025-03-03 17:50:21,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:50:21,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:50:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:50:21,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:50:21,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:50:21,566 INFO L87 Difference]: Start difference. First operand 2854 states and 4274 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:50:23,237 INFO L93 Difference]: Finished difference Result 7390 states and 11072 transitions. [2025-03-03 17:50:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:50:23,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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 127 [2025-03-03 17:50:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:50:23,248 INFO L225 Difference]: With dead ends: 7390 [2025-03-03 17:50:23,248 INFO L226 Difference]: Without dead ends: 4755 [2025-03-03 17:50:23,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:50:23,253 INFO L435 NwaCegarLoop]: 3469 mSDtfsCounter, 3068 mSDsluCounter, 13656 mSDsCounter, 0 mSdLazyCounter, 3503 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3068 SdHoareTripleChecker+Valid, 17125 SdHoareTripleChecker+Invalid, 3504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:50:23,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3068 Valid, 17125 Invalid, 3504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3503 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 17:50:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2025-03-03 17:50:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 2849. [2025-03-03 17:50:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2848 states have (on average 1.498244382022472) internal successors, (4267), 2848 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 4267 transitions. [2025-03-03 17:50:23,297 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 4267 transitions. Word has length 127 [2025-03-03 17:50:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:50:23,297 INFO L471 AbstractCegarLoop]: Abstraction has 2849 states and 4267 transitions. [2025-03-03 17:50:23,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:50:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 4267 transitions. [2025-03-03 17:50:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 17:50:23,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:23,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:23,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:50:23,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:23,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash 35702649, now seen corresponding path program 1 times [2025-03-03 17:50:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:50:23,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627855402] [2025-03-03 17:50:23,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:23,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:50:23,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 17:50:23,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 17:50:23,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:23,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:50:23,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:50:23,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 17:50:23,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 17:50:23,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:23,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:50:23,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:50:23,451 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:50:23,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:50:23,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:50:23,456 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:23,518 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:50:23,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:50:23,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:50:23 BoogieIcfgContainer [2025-03-03 17:50:23,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:50:23,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:50:23,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:50:23,540 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:50:23,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:50:09" (3/4) ... [2025-03-03 17:50:23,542 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:50:23,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:50:23,543 INFO L158 Benchmark]: Toolchain (without parser) took 23166.09ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 109.1MB in the beginning and 279.5MB in the end (delta: -170.4MB). Peak memory consumption was 482.3MB. Max. memory is 16.1GB. [2025-03-03 17:50:23,544 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:50:23,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.02ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 65.0MB in the end (delta: 44.1MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2025-03-03 17:50:23,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 613.50ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 64.3MB in the beginning and 140.0MB in the end (delta: -75.7MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2025-03-03 17:50:23,545 INFO L158 Benchmark]: Boogie Preprocessor took 615.22ms. Allocated memory is still 369.1MB. Free memory was 140.0MB in the beginning and 148.9MB in the end (delta: -8.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-03-03 17:50:23,545 INFO L158 Benchmark]: IcfgBuilder took 7515.98ms. Allocated memory was 369.1MB in the beginning and 813.7MB in the end (delta: 444.6MB). Free memory was 148.9MB in the beginning and 417.7MB in the end (delta: -268.8MB). Peak memory consumption was 526.9MB. Max. memory is 16.1GB. [2025-03-03 17:50:23,545 INFO L158 Benchmark]: TraceAbstraction took 13801.18ms. Allocated memory was 813.7MB in the beginning and 788.5MB in the end (delta: -25.2MB). Free memory was 417.7MB in the beginning and 279.6MB in the end (delta: 138.1MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2025-03-03 17:50:23,546 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 788.5MB. Free memory was 279.6MB in the beginning and 279.5MB in the end (delta: 42.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:50:23,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.02ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 65.0MB in the end (delta: 44.1MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 613.50ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 64.3MB in the beginning and 140.0MB in the end (delta: -75.7MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 615.22ms. Allocated memory is still 369.1MB. Free memory was 140.0MB in the beginning and 148.9MB in the end (delta: -8.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * IcfgBuilder took 7515.98ms. Allocated memory was 369.1MB in the beginning and 813.7MB in the end (delta: 444.6MB). Free memory was 148.9MB in the beginning and 417.7MB in the end (delta: -268.8MB). Peak memory consumption was 526.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13801.18ms. Allocated memory was 813.7MB in the beginning and 788.5MB in the end (delta: -25.2MB). Free memory was 417.7MB in the beginning and 279.6MB in the end (delta: 138.1MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 788.5MB. Free memory was 279.6MB in the beginning and 279.5MB in the end (delta: 42.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 286, overapproximation of bitwiseAnd at line 288. 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 - 32); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L35] const SORT_2 var_4 = 0; [L36] const SORT_1 var_25 = 0; [L37] const SORT_3 var_88 = 1; [L38] const SORT_3 var_89 = 0; [L39] const SORT_2 var_98 = 255; [L40] const SORT_2 var_100 = 0; [L41] const SORT_2 var_103 = 2; [L42] const SORT_2 var_107 = 1; [L44] SORT_1 input_99; [L45] SORT_1 input_104; [L46] SORT_1 input_108; [L47] SORT_1 input_111; [L48] SORT_1 input_123; [L49] SORT_1 input_135; [L50] SORT_1 input_147; [L51] SORT_1 input_150; [L52] SORT_1 input_153; [L53] SORT_1 input_156; [L54] SORT_1 input_166; [L55] SORT_1 input_176; [L56] SORT_1 input_186; [L57] SORT_1 input_187; [L58] SORT_1 input_188; [L59] SORT_1 input_189; [L60] SORT_1 input_190; [L61] SORT_1 input_191; [L62] SORT_1 input_215; [L63] SORT_1 input_217; [L64] SORT_1 input_227; [L65] SORT_1 input_232; [L66] SORT_1 input_234; [L67] SORT_1 input_239; [L68] SORT_1 input_243; [L69] SORT_1 input_258; [L70] SORT_1 input_260; [L71] SORT_1 input_270; [L72] SORT_1 input_275; [L73] SORT_1 input_277; [L74] SORT_1 input_282; [L75] SORT_1 input_286; [L76] SORT_1 input_301; [L77] SORT_1 input_303; [L78] SORT_1 input_313; [L79] SORT_1 input_318; [L80] SORT_1 input_320; [L81] SORT_1 input_325; [L82] SORT_1 input_329; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L84] SORT_2 state_5 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L85] SORT_2 state_7 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L86] SORT_2 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L87] SORT_2 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L88] SORT_2 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L89] SORT_2 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L90] SORT_2 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L91] SORT_2 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L92] SORT_2 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L93] SORT_2 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L94] SORT_1 state_26 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L95] SORT_1 state_28 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L96] SORT_1 state_30 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L97] SORT_1 state_32 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L98] SORT_1 state_34 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L99] SORT_1 state_36 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L100] SORT_1 state_38 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L101] SORT_1 state_40 = __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_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L102] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L103] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L104] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L105] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L106] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L107] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L108] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L109] SORT_1 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L110] SORT_1 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L111] SORT_1 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L112] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L113] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L114] SORT_1 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L115] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L116] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L117] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L118] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L119] SORT_1 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L120] SORT_1 state_78 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L121] SORT_1 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L122] SORT_1 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L123] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L124] SORT_1 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L126] SORT_2 init_6_arg_1 = var_4; [L127] state_5 = init_6_arg_1 [L128] SORT_2 init_8_arg_1 = var_4; [L129] state_7 = init_8_arg_1 [L130] SORT_2 init_10_arg_1 = var_4; [L131] state_9 = init_10_arg_1 [L132] SORT_2 init_12_arg_1 = var_4; [L133] state_11 = init_12_arg_1 [L134] SORT_2 init_14_arg_1 = var_4; [L135] state_13 = init_14_arg_1 [L136] SORT_2 init_16_arg_1 = var_4; [L137] state_15 = init_16_arg_1 [L138] SORT_2 init_18_arg_1 = var_4; [L139] state_17 = init_18_arg_1 [L140] SORT_2 init_20_arg_1 = var_4; [L141] state_19 = init_20_arg_1 [L142] SORT_2 init_22_arg_1 = var_4; [L143] state_21 = init_22_arg_1 [L144] SORT_2 init_24_arg_1 = var_4; [L145] state_23 = init_24_arg_1 [L146] SORT_1 init_27_arg_1 = var_25; [L147] state_26 = init_27_arg_1 [L148] SORT_1 init_29_arg_1 = var_25; [L149] state_28 = init_29_arg_1 [L150] SORT_1 init_31_arg_1 = var_25; [L151] state_30 = init_31_arg_1 [L152] SORT_1 init_33_arg_1 = var_25; [L153] state_32 = init_33_arg_1 [L154] SORT_1 init_35_arg_1 = var_25; [L155] state_34 = init_35_arg_1 [L156] SORT_1 init_37_arg_1 = var_25; [L157] state_36 = init_37_arg_1 [L158] SORT_1 init_39_arg_1 = var_25; [L159] state_38 = init_39_arg_1 [L160] SORT_1 init_41_arg_1 = var_25; [L161] state_40 = init_41_arg_1 [L162] SORT_1 init_43_arg_1 = var_25; [L163] state_42 = init_43_arg_1 [L164] SORT_1 init_45_arg_1 = var_25; [L165] state_44 = init_45_arg_1 [L166] SORT_1 init_47_arg_1 = var_25; [L167] state_46 = init_47_arg_1 [L168] SORT_1 init_49_arg_1 = var_25; [L169] state_48 = init_49_arg_1 [L170] SORT_1 init_51_arg_1 = var_25; [L171] state_50 = init_51_arg_1 [L172] SORT_1 init_53_arg_1 = var_25; [L173] state_52 = init_53_arg_1 [L174] SORT_1 init_55_arg_1 = var_25; [L175] state_54 = init_55_arg_1 [L176] SORT_1 init_57_arg_1 = var_25; [L177] state_56 = init_57_arg_1 [L178] SORT_1 init_59_arg_1 = var_25; [L179] state_58 = init_59_arg_1 [L180] SORT_1 init_61_arg_1 = var_25; [L181] state_60 = init_61_arg_1 [L182] SORT_1 init_63_arg_1 = var_25; [L183] state_62 = init_63_arg_1 [L184] SORT_1 init_65_arg_1 = var_25; [L185] state_64 = init_65_arg_1 [L186] SORT_1 init_67_arg_1 = var_25; [L187] state_66 = init_67_arg_1 [L188] SORT_1 init_69_arg_1 = var_25; [L189] state_68 = init_69_arg_1 [L190] SORT_1 init_71_arg_1 = var_25; [L191] state_70 = init_71_arg_1 [L192] SORT_1 init_73_arg_1 = var_25; [L193] state_72 = init_73_arg_1 [L194] SORT_1 init_75_arg_1 = var_25; [L195] state_74 = init_75_arg_1 [L196] SORT_1 init_77_arg_1 = var_25; [L197] state_76 = init_77_arg_1 [L198] SORT_1 init_79_arg_1 = var_25; [L199] state_78 = init_79_arg_1 [L200] SORT_1 init_81_arg_1 = var_25; [L201] state_80 = init_81_arg_1 [L202] SORT_1 init_83_arg_1 = var_25; [L203] state_82 = init_83_arg_1 [L204] SORT_1 init_85_arg_1 = var_25; [L205] state_84 = init_85_arg_1 [L206] SORT_1 init_87_arg_1 = var_25; [L207] state_86 = init_87_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L210] input_99 = __VERIFIER_nondet_uchar() [L211] input_104 = __VERIFIER_nondet_uchar() [L212] input_108 = __VERIFIER_nondet_uchar() [L213] input_111 = __VERIFIER_nondet_uchar() [L214] EXPR input_111 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L214] input_111 = input_111 & mask_SORT_1 [L215] input_123 = __VERIFIER_nondet_uchar() [L216] EXPR input_123 & mask_SORT_1 VAL [input_111=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L216] input_123 = input_123 & mask_SORT_1 [L217] input_135 = __VERIFIER_nondet_uchar() [L218] EXPR input_135 & mask_SORT_1 VAL [input_111=0, input_123=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L218] input_135 = input_135 & mask_SORT_1 [L219] input_147 = __VERIFIER_nondet_uchar() [L220] input_150 = __VERIFIER_nondet_uchar() [L221] input_153 = __VERIFIER_nondet_uchar() [L222] input_156 = __VERIFIER_nondet_uchar() [L223] EXPR input_156 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L223] input_156 = input_156 & mask_SORT_1 [L224] input_166 = __VERIFIER_nondet_uchar() [L225] EXPR input_166 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L225] input_166 = input_166 & mask_SORT_1 [L226] input_176 = __VERIFIER_nondet_uchar() [L227] EXPR input_176 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L227] input_176 = input_176 & mask_SORT_1 [L228] input_186 = __VERIFIER_nondet_uchar() [L229] EXPR input_186 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L229] input_186 = input_186 & mask_SORT_1 [L230] input_187 = __VERIFIER_nondet_uchar() [L231] EXPR input_187 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L231] input_187 = input_187 & mask_SORT_1 [L232] input_188 = __VERIFIER_nondet_uchar() [L233] EXPR input_188 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L233] input_188 = input_188 & mask_SORT_1 [L234] input_189 = __VERIFIER_nondet_uchar() [L235] EXPR input_189 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L235] input_189 = input_189 & mask_SORT_1 [L236] input_190 = __VERIFIER_nondet_uchar() [L237] EXPR input_190 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L237] input_190 = input_190 & mask_SORT_1 [L238] input_191 = __VERIFIER_nondet_uchar() [L239] EXPR input_191 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L239] input_191 = input_191 & mask_SORT_1 [L240] input_215 = __VERIFIER_nondet_uchar() [L241] input_217 = __VERIFIER_nondet_uchar() [L242] input_227 = __VERIFIER_nondet_uchar() [L243] input_232 = __VERIFIER_nondet_uchar() [L244] input_234 = __VERIFIER_nondet_uchar() [L245] input_239 = __VERIFIER_nondet_uchar() [L246] input_243 = __VERIFIER_nondet_uchar() [L247] input_258 = __VERIFIER_nondet_uchar() [L248] input_260 = __VERIFIER_nondet_uchar() [L249] input_270 = __VERIFIER_nondet_uchar() [L250] input_275 = __VERIFIER_nondet_uchar() [L251] input_277 = __VERIFIER_nondet_uchar() [L252] input_282 = __VERIFIER_nondet_uchar() [L253] input_286 = __VERIFIER_nondet_uchar() [L254] input_301 = __VERIFIER_nondet_uchar() [L255] input_303 = __VERIFIER_nondet_uchar() [L256] input_313 = __VERIFIER_nondet_uchar() [L257] input_318 = __VERIFIER_nondet_uchar() [L258] input_320 = __VERIFIER_nondet_uchar() [L259] input_325 = __VERIFIER_nondet_uchar() [L260] input_329 = __VERIFIER_nondet_uchar() [L263] SORT_1 var_90_arg_0 = state_38; [L264] SORT_3 var_90_arg_1 = var_88; [L265] SORT_3 var_90_arg_2 = var_89; [L266] SORT_3 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L267] SORT_1 var_91_arg_0 = state_58; [L268] SORT_3 var_91_arg_1 = var_88; [L269] SORT_3 var_91_arg_2 = var_89; [L270] SORT_3 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L271] SORT_3 var_92_arg_0 = var_90; [L272] SORT_3 var_92_arg_1 = var_91; [L273] SORT_3 var_92 = var_92_arg_0 + var_92_arg_1; [L274] SORT_1 var_93_arg_0 = state_78; [L275] SORT_3 var_93_arg_1 = var_88; [L276] SORT_3 var_93_arg_2 = var_89; [L277] SORT_3 var_93 = var_93_arg_0 ? var_93_arg_1 : var_93_arg_2; [L278] SORT_3 var_94_arg_0 = var_92; [L279] SORT_3 var_94_arg_1 = var_93; [L280] SORT_3 var_94 = var_94_arg_0 + var_94_arg_1; VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, input_191=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_94=0, var_98=255] [L281] EXPR var_94 & mask_SORT_3 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, input_191=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L281] var_94 = var_94 & mask_SORT_3 [L282] SORT_3 var_95_arg_0 = var_94; [L283] SORT_3 var_95_arg_1 = var_88; [L284] SORT_1 var_95 = var_95_arg_0 <= var_95_arg_1; [L285] SORT_1 var_96_arg_0 = ~state_86; VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, input_191=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_95=1, var_96_arg_0=-1, var_98=255] [L286] EXPR var_96_arg_0 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, input_191=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_95=1, var_98=255] [L286] var_96_arg_0 = var_96_arg_0 & mask_SORT_1 [L287] SORT_1 var_96_arg_1 = ~var_95; VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, input_191=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_96_arg_0=1, var_96_arg_1=-2, var_98=255] [L288] EXPR var_96_arg_1 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, input_191=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_96_arg_0=1, var_98=255] [L288] var_96_arg_1 = var_96_arg_1 & mask_SORT_1 [L289] EXPR var_96_arg_0 & var_96_arg_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, input_191=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L289] SORT_1 var_96 = var_96_arg_0 & var_96_arg_1; [L290] EXPR var_96 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_156=0, input_166=0, input_176=0, input_186=0, input_187=0, input_188=0, input_189=0, input_190=0, input_191=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L290] var_96 = var_96 & mask_SORT_1 [L291] SORT_1 bad_97_arg_0 = var_96; [L292] CALL __VERIFIER_assert(!(bad_97_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2786 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11192 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11192 mSDsluCounter, 70384 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50950 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20969 IncrementalHoareTripleChecker+Invalid, 20973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 19434 mSDtfsCounter, 20969 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2854occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 4457 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 873 NumberOfCodeBlocks, 873 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 2948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:50:23,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 962be9cd8b592d9cbf1ca24e2eb1efd6754550bace2271743b15f2e4c8026f80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:50:25,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:50:25,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:50:25,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:50:25,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:50:25,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:50:25,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:50:25,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:50:25,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:50:25,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:50:25,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:50:25,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:50:25,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:50:25,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:50:25,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:50:25,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:50:25,535 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 962be9cd8b592d9cbf1ca24e2eb1efd6754550bace2271743b15f2e4c8026f80 [2025-03-03 17:50:25,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:50:25,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:50:25,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:50:25,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:50:25,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:50:25,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c [2025-03-03 17:50:26,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61c6f7f21/7de8af0926974b82bf4a5a3f307f3fbc/FLAG618972cdf [2025-03-03 17:50:27,303 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:50:27,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c [2025-03-03 17:50:27,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61c6f7f21/7de8af0926974b82bf4a5a3f307f3fbc/FLAG618972cdf [2025-03-03 17:50:27,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61c6f7f21/7de8af0926974b82bf4a5a3f307f3fbc [2025-03-03 17:50:27,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:50:27,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:50:27,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:50:27,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:50:27,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:50:27,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:27,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198bf93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27, skipping insertion in model container [2025-03-03 17:50:27,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:27,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:50:27,527 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c[1170,1183] [2025-03-03 17:50:27,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:50:27,751 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:50:27,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.1.prop1-func-interl.c[1170,1183] [2025-03-03 17:50:27,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:50:27,871 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:50:27,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27 WrapperNode [2025-03-03 17:50:27,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:50:27,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:50:27,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:50:27,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:50:27,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:27,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:27,996 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2351 [2025-03-03 17:50:27,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:50:27,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:50:27,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:50:27,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:50:28,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,053 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:50:28,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:50:28,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:50:28,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:50:28,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:50:28,120 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (1/1) ... [2025-03-03 17:50:28,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:50:28,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:50:28,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:50:28,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:50:28,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:50:28,489 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:50:28,490 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:50:30,077 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-03-03 17:50:30,077 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:50:30,083 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:50:30,083 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:50:30,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:50:30 BoogieIcfgContainer [2025-03-03 17:50:30,083 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:50:30,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:50:30,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:50:30,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:50:30,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:50:27" (1/3) ... [2025-03-03 17:50:30,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b173c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:50:30, skipping insertion in model container [2025-03-03 17:50:30,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:50:27" (2/3) ... [2025-03-03 17:50:30,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b173c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:50:30, skipping insertion in model container [2025-03-03 17:50:30,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:50:30" (3/3) ... [2025-03-03 17:50:30,094 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mcs.1.prop1-func-interl.c [2025-03-03 17:50:30,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:50:30,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mcs.1.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:50:30,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:50:30,146 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;@7f0076b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:50:30,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:50:30,149 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-03-03 17:50:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:50:30,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:30,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:50:30,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:30,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:50:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:50:30,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275696757] [2025-03-03 17:50:30,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:30,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:50:30,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:50:30,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:50:30,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:50:30,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:50:30,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:50:30,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:30,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:50:30,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 17:50:30,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:50:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:50:30,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:50:30,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:50:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275696757] [2025-03-03 17:50:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275696757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:50:30,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:50:30,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:50:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379095321] [2025-03-03 17:50:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:50:30,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:50:30,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:50:30,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:50:30,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:50:30,849 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-03-03 17:50:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:50:30,974 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:50:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:50:30,976 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-03-03 17:50:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:50:30,983 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:50:30,984 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:50:30,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:50:30,987 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-03-03 17:50:30,987 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-03-03 17:50:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:50:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:50:31,002 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-03-03 17:50:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:50:31,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:50:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:50:31,005 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:50:31,005 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-03-03 17:50:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:50:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:50:31,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:50:31,005 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:50:31,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:50:31,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:50:31,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:50:31,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:50:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:50:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:50:31,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362021234] [2025-03-03 17:50:31,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:50:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:50:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:50:31,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:50:31,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:50:31,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:50:31,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:50:31,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:50:31,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:50:31,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 17:50:31,727 INFO L279 TraceCheckSpWp]: Computing forward predicates...