./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.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.bakery.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:42:08,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:42:08,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 16:42:08,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:42:08,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:42:08,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:42:08,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:42:08,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:42:08,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:42:08,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:42:08,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:42:08,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:42:08,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:42:08,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:42:08,945 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:42:08,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:42:08,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:42:08,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:42:08,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:42:08,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:42:08,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:42:08,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:42:08,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:42:08,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:42:08,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:42:08,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:42:08,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:42:08,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:42:08,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:42:08,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:42:08,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:42:08,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:42:08,947 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:42:08,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:42:08,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:42:08,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:42:08,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:42:08,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:42:08,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:42:08,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:42:08,947 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 -> fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 [2025-03-03 16:42:09,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:42:09,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:42:09,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:42:09,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:42:09,176 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:42:09,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-03 16:42:10,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c4f94f7/ecb0855534764b30b14f963e4e44d4a5/FLAG1809758cc [2025-03-03 16:42:10,558 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:42:10,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-03 16:42:10,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c4f94f7/ecb0855534764b30b14f963e4e44d4a5/FLAG1809758cc [2025-03-03 16:42:10,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c4f94f7/ecb0855534764b30b14f963e4e44d4a5 [2025-03-03 16:42:10,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:42:10,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:42:10,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:42:10,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:42:10,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:42:10,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:42:10" (1/1) ... [2025-03-03 16:42:10,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f9b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:10, skipping insertion in model container [2025-03-03 16:42:10,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:42:10" (1/1) ... [2025-03-03 16:42:10,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:42:11,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c[1173,1186] [2025-03-03 16:42:11,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:42:11,279 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:42:11,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c[1173,1186] [2025-03-03 16:42:11,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:42:11,385 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:42:11,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11 WrapperNode [2025-03-03 16:42:11,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:42:11,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:42:11,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:42:11,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:42:11,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:11,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:11,726 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3501 [2025-03-03 16:42:11,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:42:11,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:42:11,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:42:11,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:42:11,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:11,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:11,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:11,925 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 16:42:11,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:11,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:12,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:12,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:12,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:12,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:12,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:42:12,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:42:12,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:42:12,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:42:12,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (1/1) ... [2025-03-03 16:42:12,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:42:12,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:42:12,204 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 16:42:12,209 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 16:42:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:42:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:42:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:42:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:42:12,501 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:42:12,502 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:42:15,184 INFO L? ?]: Removed 1945 outVars from TransFormulas that were not future-live. [2025-03-03 16:42:15,184 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:42:15,370 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:42:15,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:42:15,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:42:15 BoogieIcfgContainer [2025-03-03 16:42:15,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:42:15,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:42:15,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:42:15,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:42:15,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:42:10" (1/3) ... [2025-03-03 16:42:15,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3770d0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:42:15, skipping insertion in model container [2025-03-03 16:42:15,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:11" (2/3) ... [2025-03-03 16:42:15,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3770d0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:42:15, skipping insertion in model container [2025-03-03 16:42:15,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:42:15" (3/3) ... [2025-03-03 16:42:15,378 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-03 16:42:15,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:42:15,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c that has 1 procedures, 1214 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:42:15,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:42:15,471 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;@21a7bed1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:42:15,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:42:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 1214 states, 1212 states have (on average 1.4991749174917492) internal successors, (1817), 1213 states have internal predecessors, (1817), 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 16:42:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:42:15,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:15,488 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] [2025-03-03 16:42:15,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:15,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1595417857, now seen corresponding path program 1 times [2025-03-03 16:42:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:42:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33758963] [2025-03-03 16:42:15,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:42:15,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:42:15,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:42:15,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:15,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:42:16,151 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 16:42:16,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:42:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33758963] [2025-03-03 16:42:16,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33758963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:42:16,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:42:16,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:42:16,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966872691] [2025-03-03 16:42:16,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:42:16,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:42:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:42:16,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:42:16,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:42:16,180 INFO L87 Difference]: Start difference. First operand has 1214 states, 1212 states have (on average 1.4991749174917492) internal successors, (1817), 1213 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 16:42:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:42:16,778 INFO L93 Difference]: Finished difference Result 2349 states and 3519 transitions. [2025-03-03 16:42:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:42:16,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2025-03-03 16:42:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:42:16,797 INFO L225 Difference]: With dead ends: 2349 [2025-03-03 16:42:16,799 INFO L226 Difference]: Without dead ends: 1213 [2025-03-03 16:42:16,812 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 16:42:16,814 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4525 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:42:16,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4525 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:42:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-03 16:42:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2025-03-03 16:42:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 1.4975247524752475) internal successors, (1815), 1212 states have internal predecessors, (1815), 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 16:42:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1815 transitions. [2025-03-03 16:42:16,928 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1815 transitions. Word has length 77 [2025-03-03 16:42:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:42:16,928 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1815 transitions. [2025-03-03 16:42:16,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 16:42:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1815 transitions. [2025-03-03 16:42:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 16:42:16,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:16,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:42:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:42:16,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2086334985, now seen corresponding path program 1 times [2025-03-03 16:42:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:42:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115895224] [2025-03-03 16:42:16,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:42:17,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:42:17,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:42:17,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:17,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:42:17,185 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 16:42:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:42:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115895224] [2025-03-03 16:42:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115895224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:42:17,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:42:17,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:42:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878447539] [2025-03-03 16:42:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:42:17,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:42:17,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:42:17,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:42:17,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:42:17,189 INFO L87 Difference]: Start difference. First operand 1213 states and 1815 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:42:17,664 INFO L93 Difference]: Finished difference Result 2350 states and 3517 transitions. [2025-03-03 16:42:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:42:17,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 16:42:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:42:17,671 INFO L225 Difference]: With dead ends: 2350 [2025-03-03 16:42:17,671 INFO L226 Difference]: Without dead ends: 1215 [2025-03-03 16:42:17,673 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 16:42:17,673 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3012 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:42:17,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4522 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:42:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-03 16:42:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2025-03-03 16:42:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 1.4967051070840198) internal successors, (1817), 1214 states have internal predecessors, (1817), 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 16:42:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1817 transitions. [2025-03-03 16:42:17,706 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1817 transitions. Word has length 78 [2025-03-03 16:42:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:42:17,707 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1817 transitions. [2025-03-03 16:42:17,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1817 transitions. [2025-03-03 16:42:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:42:17,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:17,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:42:17,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:42:17,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:17,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:17,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2111581126, now seen corresponding path program 1 times [2025-03-03 16:42:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:42:17,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696575951] [2025-03-03 16:42:17,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:17,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:42:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:42:17,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:42:17,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:17,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:42:17,916 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 16:42:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:42:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696575951] [2025-03-03 16:42:17,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696575951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:42:17,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:42:17,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:42:17,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686826107] [2025-03-03 16:42:17,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:42:17,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:42:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:42:17,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:42:17,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:42:17,919 INFO L87 Difference]: Start difference. First operand 1215 states and 1817 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:42:18,396 INFO L93 Difference]: Finished difference Result 2354 states and 3521 transitions. [2025-03-03 16:42:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:42:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 16:42:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:42:18,401 INFO L225 Difference]: With dead ends: 2354 [2025-03-03 16:42:18,401 INFO L226 Difference]: Without dead ends: 1217 [2025-03-03 16:42:18,402 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 16:42:18,403 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:42:18,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4517 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:42:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-03 16:42:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2025-03-03 16:42:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 1.495888157894737) internal successors, (1819), 1216 states have internal predecessors, (1819), 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 16:42:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1819 transitions. [2025-03-03 16:42:18,432 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1819 transitions. Word has length 79 [2025-03-03 16:42:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:42:18,433 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1819 transitions. [2025-03-03 16:42:18,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1819 transitions. [2025-03-03 16:42:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:42:18,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:18,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:42:18,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:42:18,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash 853858894, now seen corresponding path program 1 times [2025-03-03 16:42:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:42:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864237826] [2025-03-03 16:42:18,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:42:18,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:42:18,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:42:18,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:18,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:42:18,584 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 16:42:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:42:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864237826] [2025-03-03 16:42:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864237826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:42:18,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:42:18,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:42:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507239093] [2025-03-03 16:42:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:42:18,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:42:18,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:42:18,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:42:18,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:42:18,585 INFO L87 Difference]: Start difference. First operand 1217 states and 1819 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:42:19,029 INFO L93 Difference]: Finished difference Result 2364 states and 3533 transitions. [2025-03-03 16:42:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:42:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 16:42:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:42:19,035 INFO L225 Difference]: With dead ends: 2364 [2025-03-03 16:42:19,035 INFO L226 Difference]: Without dead ends: 1225 [2025-03-03 16:42:19,037 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 16:42:19,037 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 3 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:42:19,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4517 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:42:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-03 16:42:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1221. [2025-03-03 16:42:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 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 16:42:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1825 transitions. [2025-03-03 16:42:19,059 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1825 transitions. Word has length 80 [2025-03-03 16:42:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:42:19,060 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1825 transitions. [2025-03-03 16:42:19,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1825 transitions. [2025-03-03 16:42:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:42:19,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:19,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:42:19,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:42:19,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1399621237, now seen corresponding path program 1 times [2025-03-03 16:42:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:42:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488100257] [2025-03-03 16:42:19,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:42:19,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:42:19,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:42:19,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:19,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:42:19,301 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 16:42:19,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:42:19,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488100257] [2025-03-03 16:42:19,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488100257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:42:19,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:42:19,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:42:19,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841413932] [2025-03-03 16:42:19,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:42:19,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:42:19,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:42:19,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:42:19,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:42:19,303 INFO L87 Difference]: Start difference. First operand 1221 states and 1825 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:42:20,905 INFO L93 Difference]: Finished difference Result 3491 states and 5219 transitions. [2025-03-03 16:42:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:42:20,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 16:42:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:42:20,912 INFO L225 Difference]: With dead ends: 3491 [2025-03-03 16:42:20,912 INFO L226 Difference]: Without dead ends: 2348 [2025-03-03 16:42:20,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:42:20,914 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 1727 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:42:20,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 4626 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 16:42:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-03-03 16:42:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1276. [2025-03-03 16:42:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.4949019607843137) internal successors, (1906), 1275 states have internal predecessors, (1906), 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 16:42:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1906 transitions. [2025-03-03 16:42:20,938 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1906 transitions. Word has length 81 [2025-03-03 16:42:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:42:20,938 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1906 transitions. [2025-03-03 16:42:20,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1906 transitions. [2025-03-03 16:42:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 16:42:20,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:20,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:42:20,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:42:20,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:20,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash 639582190, now seen corresponding path program 1 times [2025-03-03 16:42:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:42:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927931085] [2025-03-03 16:42:20,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:42:20,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 16:42:20,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 16:42:20,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:20,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:42:21,295 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 16:42:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:42:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927931085] [2025-03-03 16:42:21,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927931085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:42:21,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:42:21,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:42:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002400840] [2025-03-03 16:42:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:42:21,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:42:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:42:21,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:42:21,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:42:21,299 INFO L87 Difference]: Start difference. First operand 1276 states and 1906 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:42:22,508 INFO L93 Difference]: Finished difference Result 2434 states and 3636 transitions. [2025-03-03 16:42:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:42:22,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 16:42:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:42:22,513 INFO L225 Difference]: With dead ends: 2434 [2025-03-03 16:42:22,513 INFO L226 Difference]: Without dead ends: 1291 [2025-03-03 16:42:22,515 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 16:42:22,517 INFO L435 NwaCegarLoop]: 1164 mSDtfsCounter, 1760 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:42:22,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 4644 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2607 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 16:42:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-03 16:42:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2025-03-03 16:42:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1288 states have (on average 1.4914596273291925) internal successors, (1921), 1288 states have internal predecessors, (1921), 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 16:42:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1921 transitions. [2025-03-03 16:42:22,539 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1921 transitions. Word has length 82 [2025-03-03 16:42:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:42:22,539 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1921 transitions. [2025-03-03 16:42:22,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:42:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1921 transitions. [2025-03-03 16:42:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 16:42:22,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:22,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:42:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:42:22,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:22,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1922412680, now seen corresponding path program 1 times [2025-03-03 16:42:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:42:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152656261] [2025-03-03 16:42:22,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:22,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:42:22,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 16:42:22,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 16:42:22,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:22,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:42:22,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 16:42:22,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 16:42:22,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 16:42:22,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:22,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:42:22,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 16:42:22,638 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 16:42:22,639 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 16:42:22,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:42:22,643 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:42:22,676 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 16:42:22,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 16:42:22,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:42:22 BoogieIcfgContainer [2025-03-03 16:42:22,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 16:42:22,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 16:42:22,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 16:42:22,694 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 16:42:22,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:42:15" (3/4) ... [2025-03-03 16:42:22,697 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 16:42:22,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 16:42:22,698 INFO L158 Benchmark]: Toolchain (without parser) took 11826.43ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 121.4MB in the beginning and 183.8MB in the end (delta: -62.4MB). Peak memory consumption was 261.5MB. Max. memory is 16.1GB. [2025-03-03 16:42:22,698 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:42:22,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.08ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 73.3MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 16:42:22,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 340.65ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 73.3MB in the beginning and 69.3MB in the end (delta: 3.9MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2025-03-03 16:42:22,699 INFO L158 Benchmark]: Boogie Preprocessor took 408.27ms. Allocated memory was 176.2MB in the beginning and 528.5MB in the end (delta: 352.3MB). Free memory was 69.3MB in the beginning and 423.4MB in the end (delta: -354.0MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2025-03-03 16:42:22,700 INFO L158 Benchmark]: IcfgBuilder took 3234.18ms. Allocated memory was 528.5MB in the beginning and 369.1MB in the end (delta: -159.4MB). Free memory was 423.4MB in the beginning and 210.9MB in the end (delta: 212.4MB). Peak memory consumption was 238.9MB. Max. memory is 16.1GB. [2025-03-03 16:42:22,700 INFO L158 Benchmark]: TraceAbstraction took 7321.11ms. Allocated memory was 369.1MB in the beginning and 486.5MB in the end (delta: 117.4MB). Free memory was 210.9MB in the beginning and 183.9MB in the end (delta: 27.1MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. [2025-03-03 16:42:22,700 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 486.5MB. Free memory was 183.9MB in the beginning and 183.8MB in the end (delta: 40.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:42:22,703 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.08ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 73.3MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 340.65ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 73.3MB in the beginning and 69.3MB in the end (delta: 3.9MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 408.27ms. Allocated memory was 176.2MB in the beginning and 528.5MB in the end (delta: 352.3MB). Free memory was 69.3MB in the beginning and 423.4MB in the end (delta: -354.0MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * IcfgBuilder took 3234.18ms. Allocated memory was 528.5MB in the beginning and 369.1MB in the end (delta: -159.4MB). Free memory was 423.4MB in the beginning and 210.9MB in the end (delta: 212.4MB). Peak memory consumption was 238.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7321.11ms. Allocated memory was 369.1MB in the beginning and 486.5MB in the end (delta: 117.4MB). Free memory was 210.9MB in the beginning and 183.9MB in the end (delta: 27.1MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 486.5MB. Free memory was 183.9MB in the beginning and 183.8MB in the end (delta: 40.6kB). 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 172, overapproximation of bitwiseAnd at line 174. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_22 = 0; [L40] const SORT_4 var_45 = 1; [L41] const SORT_4 var_46 = 0; [L42] const SORT_2 var_54 = 0; [L43] const SORT_2 var_56 = 1; [L44] const SORT_3 var_66 = 0; [L45] const SORT_4 var_153 = 2; [L46] const SORT_2 var_165 = 2; [L47] const SORT_4 var_167 = 6; [L49] SORT_1 input_53; [L50] SORT_1 input_55; [L51] SORT_1 input_60; [L52] SORT_1 input_61; [L53] SORT_1 input_65; [L54] SORT_1 input_73; [L55] SORT_1 input_80; [L56] SORT_1 input_84; [L57] SORT_1 input_85; [L58] SORT_1 input_97; [L59] SORT_1 input_101; [L60] SORT_1 input_102; [L61] SORT_1 input_121; [L62] SORT_1 input_124; [L63] SORT_1 input_140; [L64] SORT_1 input_143; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L66] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L67] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L68] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L69] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L70] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L71] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L72] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L73] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L74] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L75] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L76] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L77] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L78] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L79] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L80] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L81] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L82] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L83] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_153=2, var_165=2, var_167=6, var_22=0, var_45=1, var_46=0, var_54=0, var_56=1, var_5=0, var_66=0] [L84] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] SORT_2 init_7_arg_1 = var_5; [L87] state_6 = init_7_arg_1 [L88] SORT_2 init_9_arg_1 = var_5; [L89] state_8 = init_9_arg_1 [L90] SORT_2 init_11_arg_1 = var_5; [L91] state_10 = init_11_arg_1 [L92] SORT_2 init_13_arg_1 = var_5; [L93] state_12 = init_13_arg_1 [L94] SORT_2 init_15_arg_1 = var_5; [L95] state_14 = init_15_arg_1 [L96] SORT_2 init_17_arg_1 = var_5; [L97] state_16 = init_17_arg_1 [L98] SORT_2 init_19_arg_1 = var_5; [L99] state_18 = init_19_arg_1 [L100] SORT_2 init_21_arg_1 = var_5; [L101] state_20 = init_21_arg_1 [L102] SORT_1 init_24_arg_1 = var_22; [L103] state_23 = init_24_arg_1 [L104] SORT_1 init_26_arg_1 = var_22; [L105] state_25 = init_26_arg_1 [L106] SORT_1 init_28_arg_1 = var_22; [L107] state_27 = init_28_arg_1 [L108] SORT_1 init_30_arg_1 = var_22; [L109] state_29 = init_30_arg_1 [L110] SORT_1 init_32_arg_1 = var_22; [L111] state_31 = init_32_arg_1 [L112] SORT_1 init_34_arg_1 = var_22; [L113] state_33 = init_34_arg_1 [L114] SORT_1 init_36_arg_1 = var_22; [L115] state_35 = init_36_arg_1 [L116] SORT_1 init_38_arg_1 = var_22; [L117] state_37 = init_38_arg_1 [L118] SORT_1 init_40_arg_1 = var_22; [L119] state_39 = init_40_arg_1 [L120] SORT_1 init_42_arg_1 = var_22; [L121] state_41 = init_42_arg_1 [L122] SORT_1 init_44_arg_1 = var_22; [L123] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L126] input_53 = __VERIFIER_nondet_uchar() [L127] EXPR input_53 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L127] input_53 = input_53 & mask_SORT_1 [L128] input_55 = __VERIFIER_nondet_uchar() [L129] EXPR input_55 & mask_SORT_1 VAL [input_53=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L129] input_55 = input_55 & mask_SORT_1 [L130] input_60 = __VERIFIER_nondet_uchar() [L131] EXPR input_60 & mask_SORT_1 VAL [input_53=0, input_55=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L131] input_60 = input_60 & mask_SORT_1 [L132] input_61 = __VERIFIER_nondet_uchar() [L133] EXPR input_61 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L133] input_61 = input_61 & mask_SORT_1 [L134] input_65 = __VERIFIER_nondet_uchar() [L135] EXPR input_65 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L135] input_65 = input_65 & mask_SORT_1 [L136] input_73 = __VERIFIER_nondet_uchar() [L137] EXPR input_73 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L137] input_73 = input_73 & mask_SORT_1 [L138] input_80 = __VERIFIER_nondet_uchar() [L139] EXPR input_80 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L139] input_80 = input_80 & mask_SORT_1 [L140] input_84 = __VERIFIER_nondet_uchar() [L141] EXPR input_84 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L141] input_84 = input_84 & mask_SORT_1 [L142] input_85 = __VERIFIER_nondet_uchar() [L143] EXPR input_85 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L143] input_85 = input_85 & mask_SORT_1 [L144] input_97 = __VERIFIER_nondet_uchar() [L145] EXPR input_97 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L145] input_97 = input_97 & mask_SORT_1 [L146] input_101 = __VERIFIER_nondet_uchar() [L147] EXPR input_101 & mask_SORT_1 VAL [input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L147] input_101 = input_101 & mask_SORT_1 [L148] input_102 = __VERIFIER_nondet_uchar() [L149] EXPR input_102 & mask_SORT_1 VAL [input_101=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L149] input_102 = input_102 & mask_SORT_1 [L150] input_121 = __VERIFIER_nondet_uchar() [L151] input_124 = __VERIFIER_nondet_uchar() [L152] input_140 = __VERIFIER_nondet_uchar() [L153] input_143 = __VERIFIER_nondet_uchar() [L156] SORT_1 var_47_arg_0 = state_31; [L157] SORT_4 var_47_arg_1 = var_45; [L158] SORT_4 var_47_arg_2 = var_46; [L159] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L160] SORT_1 var_48_arg_0 = state_41; [L161] SORT_4 var_48_arg_1 = var_45; [L162] SORT_4 var_48_arg_2 = var_46; [L163] SORT_4 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L164] SORT_4 var_49_arg_0 = var_47; [L165] SORT_4 var_49_arg_1 = var_48; [L166] SORT_4 var_49 = var_49_arg_0 + var_49_arg_1; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_49=0, var_54=0, var_56=1, var_66=0] [L167] EXPR var_49 & mask_SORT_4 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L167] var_49 = var_49 & mask_SORT_4 [L168] SORT_4 var_50_arg_0 = var_49; [L169] SORT_4 var_50_arg_1 = var_45; [L170] SORT_1 var_50 = var_50_arg_0 <= var_50_arg_1; [L171] SORT_1 var_51_arg_0 = ~state_43; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_50=1, var_51_arg_0=-1, var_54=0, var_56=1, var_66=0] [L172] EXPR var_51_arg_0 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_50=1, var_54=0, var_56=1, var_66=0] [L172] var_51_arg_0 = var_51_arg_0 & mask_SORT_1 [L173] SORT_1 var_51_arg_1 = ~var_50; VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_51_arg_0=1, var_51_arg_1=-2, var_54=0, var_56=1, var_66=0] [L174] EXPR var_51_arg_1 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_51_arg_0=1, var_54=0, var_56=1, var_66=0] [L174] var_51_arg_1 = var_51_arg_1 & mask_SORT_1 [L175] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L175] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L176] EXPR var_51 & mask_SORT_1 VAL [input_101=0, input_102=0, input_53=0, input_55=0, input_60=0, input_61=0, input_65=0, input_73=0, input_80=0, input_84=0, input_85=0, input_97=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_6=0, state_8=0, var_153=2, var_165=2, var_167=6, var_45=1, var_46=0, var_54=0, var_56=1, var_66=0] [L176] var_51 = var_51 & mask_SORT_1 [L177] SORT_1 bad_52_arg_0 = var_51; [L178] CALL __VERIFIER_assert(!(bad_52_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1214 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3490 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3490 mSDsluCounter, 27351 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18968 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8789 IncrementalHoareTripleChecker+Invalid, 8791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 8383 mSDtfsCounter, 8789 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1289occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1078 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 471 ConstructedInterpolants, 0 QuantifiedInterpolants, 1333 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 16:42:22,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:42:24,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:42:24,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 16:42:24,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:42:24,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:42:24,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:42:24,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:42:24,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:42:24,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:42:24,700 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:42:24,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:42:24,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:42:24,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:42:24,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:42:24,701 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:42:24,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:42:24,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:42:24,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:42:24,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:42:24,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:42:24,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:42:24,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:42:24,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:42:24,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:42:24,703 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 -> fa88b8fffb6d00fe351813dff04ff095de9add832c65b297aee5013953d8af16 [2025-03-03 16:42:24,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:42:24,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:42:24,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:42:24,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:42:24,954 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:42:24,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-03 16:42:26,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16c692fa/9bf99a5c784b4432a43f2d91a313cd21/FLAG99f7cc3e9 [2025-03-03 16:42:26,334 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:42:26,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-03 16:42:26,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16c692fa/9bf99a5c784b4432a43f2d91a313cd21/FLAG99f7cc3e9 [2025-03-03 16:42:26,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d16c692fa/9bf99a5c784b4432a43f2d91a313cd21 [2025-03-03 16:42:26,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:42:26,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:42:26,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:42:26,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:42:26,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:42:26,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:42:26" (1/1) ... [2025-03-03 16:42:26,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9444724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:26, skipping insertion in model container [2025-03-03 16:42:26,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:42:26" (1/1) ... [2025-03-03 16:42:26,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:42:26,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c[1173,1186] [2025-03-03 16:42:26,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:42:26,971 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:42:26,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.2.prop1-func-interl.c[1173,1186] [2025-03-03 16:42:27,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:42:27,080 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:42:27,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27 WrapperNode [2025-03-03 16:42:27,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:42:27,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:42:27,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:42:27,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:42:27,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,156 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1093 [2025-03-03 16:42:27,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:42:27,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:42:27,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:42:27,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:42:27,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,204 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 16:42:27,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:42:27,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:42:27,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:42:27,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:42:27,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (1/1) ... [2025-03-03 16:42:27,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:42:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:42:27,308 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 16:42:27,310 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 16:42:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:42:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 16:42:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:42:27,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:42:27,524 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:42:27,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:42:28,264 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-03-03 16:42:28,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:42:28,271 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:42:28,271 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:42:28,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:42:28 BoogieIcfgContainer [2025-03-03 16:42:28,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:42:28,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:42:28,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:42:28,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:42:28,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:42:26" (1/3) ... [2025-03-03 16:42:28,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7fd19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:42:28, skipping insertion in model container [2025-03-03 16:42:28,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:42:27" (2/3) ... [2025-03-03 16:42:28,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7fd19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:42:28, skipping insertion in model container [2025-03-03 16:42:28,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:42:28" (3/3) ... [2025-03-03 16:42:28,280 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c [2025-03-03 16:42:28,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:42:28,291 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.2.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:42:28,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:42:28,332 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;@604e584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:42:28,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:42:28,336 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 16:42:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 16:42:28,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:28,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 16:42:28,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:28,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 16:42:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:42:28,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959494121] [2025-03-03 16:42:28,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:28,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:42:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:42:28,355 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 16:42:28,357 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 16:42:28,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 16:42:28,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 16:42:28,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:28,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:42:28,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 16:42:28,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:42:28,777 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 16:42:28,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:42:28,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 16:42:28,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959494121] [2025-03-03 16:42:28,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959494121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:42:28,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:42:28,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:42:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858790161] [2025-03-03 16:42:28,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:42:28,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:42:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 16:42:28,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:42:28,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:42:28,801 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 16:42:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:42:28,882 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 16:42:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:42:28,885 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 16:42:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:42:28,888 INFO L225 Difference]: With dead ends: 18 [2025-03-03 16:42:28,889 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 16:42:28,891 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 16:42:28,893 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 16:42:28,893 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 16:42:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 16:42:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 16:42:28,910 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 16:42:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 16:42:28,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 16:42:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:42:28,915 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 16:42:28,915 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 16:42:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 16:42:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 16:42:28,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:42:28,915 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 16:42:28,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:42:29,116 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 16:42:29,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:42:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:42:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 16:42:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:42:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234792558] [2025-03-03 16:42:29,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:42:29,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:42:29,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:42:29,119 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 16:42:29,120 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 16:42:29,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 16:42:29,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 16:42:29,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:42:29,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:42:29,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 16:42:29,408 INFO L279 TraceCheckSpWp]: Computing forward predicates...