./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.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.h_FIFO.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 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:18,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:18,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:35:18,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:18,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:18,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:18,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:18,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:18,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:18,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:18,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:18,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:18,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:18,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:18,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:18,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:18,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:18,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:18,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:18,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:18,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:18,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:18,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:18,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:18,296 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 -> 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 [2025-03-03 17:35:18,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:18,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:18,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:18,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:18,543 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:18,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2025-03-03 17:35:19,681 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3f0da2b5/b9aa0c5432cd4140ae35bd20988c779c/FLAGc8b2d974e [2025-03-03 17:35:19,907 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:19,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2025-03-03 17:35:19,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3f0da2b5/b9aa0c5432cd4140ae35bd20988c779c/FLAGc8b2d974e [2025-03-03 17:35:19,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3f0da2b5/b9aa0c5432cd4140ae35bd20988c779c [2025-03-03 17:35:19,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:19,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:19,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:19,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:19,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:19,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:19" (1/1) ... [2025-03-03 17:35:19,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593a7904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:19, skipping insertion in model container [2025-03-03 17:35:19,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:19" (1/1) ... [2025-03-03 17:35:19,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:20,087 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.h_FIFO.c[1246,1259] [2025-03-03 17:35:20,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:20,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:20,285 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.h_FIFO.c[1246,1259] [2025-03-03 17:35:20,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:20,375 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:20,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20 WrapperNode [2025-03-03 17:35:20,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:20,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:20,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:20,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:20,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,539 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1933 [2025-03-03 17:35:20,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:20,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:20,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:20,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:20,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,625 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:35:20,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:20,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:20,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:20,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:20,736 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:20,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:20,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:35:20,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:35:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:35:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:20,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:20,993 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:20,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:22,527 INFO L? ?]: Removed 1109 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:22,527 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:22,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:22,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:22,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:22 BoogieIcfgContainer [2025-03-03 17:35:22,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:22,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:22,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:22,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:22,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:19" (1/3) ... [2025-03-03 17:35:22,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b936712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:22, skipping insertion in model container [2025-03-03 17:35:22,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20" (2/3) ... [2025-03-03 17:35:22,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b936712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:22, skipping insertion in model container [2025-03-03 17:35:22,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:22" (3/3) ... [2025-03-03 17:35:22,668 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FIFO.c [2025-03-03 17:35:22,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:22,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_FIFO.c that has 1 procedures, 538 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:22,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:22,741 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;@7f7f494, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:22,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 538 states, 536 states have (on average 1.498134328358209) internal successors, (803), 537 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 17:35:22,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:22,750 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] [2025-03-03 17:35:22,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:22,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash 393110392, now seen corresponding path program 1 times [2025-03-03 17:35:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:22,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779817249] [2025-03-03 17:35:22,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:22,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 17:35:23,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 17:35:23,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:23,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:23,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:23,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779817249] [2025-03-03 17:35:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779817249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:23,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:23,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934065729] [2025-03-03 17:35:23,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:23,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:23,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:23,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:23,734 INFO L87 Difference]: Start difference. First operand has 538 states, 536 states have (on average 1.498134328358209) internal successors, (803), 537 states have internal predecessors, (803), 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 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:24,066 INFO L93 Difference]: Finished difference Result 1011 states and 1512 transitions. [2025-03-03 17:35:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2025-03-03 17:35:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:24,077 INFO L225 Difference]: With dead ends: 1011 [2025-03-03 17:35:24,077 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 17:35:24,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:24,083 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 737 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:24,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1311 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 17:35:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-03 17:35:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4925093632958801) internal successors, (797), 534 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 797 transitions. [2025-03-03 17:35:24,123 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 797 transitions. Word has length 69 [2025-03-03 17:35:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:24,124 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 797 transitions. [2025-03-03 17:35:24,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 797 transitions. [2025-03-03 17:35:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 17:35:24,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:24,126 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] [2025-03-03 17:35:24,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:35:24,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:24,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1439593155, now seen corresponding path program 1 times [2025-03-03 17:35:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:24,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39188929] [2025-03-03 17:35:24,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:24,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 17:35:24,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 17:35:24,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:24,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:24,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39188929] [2025-03-03 17:35:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39188929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:24,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:24,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558785853] [2025-03-03 17:35:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:24,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:24,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:24,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:24,427 INFO L87 Difference]: Start difference. First operand 535 states and 797 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:24,651 INFO L93 Difference]: Finished difference Result 539 states and 801 transitions. [2025-03-03 17:35:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:24,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2025-03-03 17:35:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:24,654 INFO L225 Difference]: With dead ends: 539 [2025-03-03 17:35:24,654 INFO L226 Difference]: Without dead ends: 537 [2025-03-03 17:35:24,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:24,655 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 0 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:24,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1984 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-03 17:35:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-03-03 17:35:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4906716417910448) internal successors, (799), 536 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 799 transitions. [2025-03-03 17:35:24,673 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 799 transitions. Word has length 71 [2025-03-03 17:35:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:24,673 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 799 transitions. [2025-03-03 17:35:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 799 transitions. [2025-03-03 17:35:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 17:35:24,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:24,675 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] [2025-03-03 17:35:24,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:35:24,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:24,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1682394690, now seen corresponding path program 1 times [2025-03-03 17:35:24,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:24,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780810445] [2025-03-03 17:35:24,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:24,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 17:35:24,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 17:35:24,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:24,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780810445] [2025-03-03 17:35:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780810445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725210960] [2025-03-03 17:35:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:25,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:25,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:25,405 INFO L87 Difference]: Start difference. First operand 537 states and 799 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:25,783 INFO L93 Difference]: Finished difference Result 1143 states and 1697 transitions. [2025-03-03 17:35:25,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:25,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2025-03-03 17:35:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:25,786 INFO L225 Difference]: With dead ends: 1143 [2025-03-03 17:35:25,786 INFO L226 Difference]: Without dead ends: 668 [2025-03-03 17:35:25,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:25,791 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 1141 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:25,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 1934 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-03 17:35:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 543. [2025-03-03 17:35:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.488929889298893) internal successors, (807), 542 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 807 transitions. [2025-03-03 17:35:25,810 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 807 transitions. Word has length 72 [2025-03-03 17:35:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:25,811 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 807 transitions. [2025-03-03 17:35:25,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 807 transitions. [2025-03-03 17:35:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 17:35:25,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:25,812 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] [2025-03-03 17:35:25,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:35:25,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:25,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash -142007518, now seen corresponding path program 1 times [2025-03-03 17:35:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:25,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344555327] [2025-03-03 17:35:25,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:25,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 17:35:25,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 17:35:25,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:25,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344555327] [2025-03-03 17:35:26,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344555327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:26,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:26,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:35:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730847002] [2025-03-03 17:35:26,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:26,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:35:26,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:26,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:35:26,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:26,055 INFO L87 Difference]: Start difference. First operand 543 states and 807 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:26,717 INFO L93 Difference]: Finished difference Result 1411 states and 2100 transitions. [2025-03-03 17:35:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:26,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2025-03-03 17:35:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:26,721 INFO L225 Difference]: With dead ends: 1411 [2025-03-03 17:35:26,721 INFO L226 Difference]: Without dead ends: 547 [2025-03-03 17:35:26,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:26,723 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 509 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:26,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 2970 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-03 17:35:26,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-03-03 17:35:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4871323529411764) internal successors, (809), 544 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 809 transitions. [2025-03-03 17:35:26,742 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 809 transitions. Word has length 73 [2025-03-03 17:35:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:26,743 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 809 transitions. [2025-03-03 17:35:26,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 809 transitions. [2025-03-03 17:35:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 17:35:26,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:26,747 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] [2025-03-03 17:35:26,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:35:26,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:26,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1018544612, now seen corresponding path program 1 times [2025-03-03 17:35:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647313213] [2025-03-03 17:35:26,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:26,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 17:35:26,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 17:35:26,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:26,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:27,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647313213] [2025-03-03 17:35:27,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647313213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:27,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:27,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043614807] [2025-03-03 17:35:27,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:27,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:27,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:27,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:27,739 INFO L87 Difference]: Start difference. First operand 545 states and 809 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:28,242 INFO L93 Difference]: Finished difference Result 1238 states and 1828 transitions. [2025-03-03 17:35:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:28,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 74 [2025-03-03 17:35:28,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:28,245 INFO L225 Difference]: With dead ends: 1238 [2025-03-03 17:35:28,245 INFO L226 Difference]: Without dead ends: 761 [2025-03-03 17:35:28,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:35:28,248 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 1479 mSDsluCounter, 2661 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:28,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 3309 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-03 17:35:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 553. [2025-03-03 17:35:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.483695652173913) internal successors, (819), 552 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 819 transitions. [2025-03-03 17:35:28,267 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 819 transitions. Word has length 74 [2025-03-03 17:35:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:28,267 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 819 transitions. [2025-03-03 17:35:28,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 819 transitions. [2025-03-03 17:35:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 17:35:28,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:28,269 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] [2025-03-03 17:35:28,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:35:28,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:28,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1322337401, now seen corresponding path program 1 times [2025-03-03 17:35:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:28,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466818891] [2025-03-03 17:35:28,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:28,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 17:35:28,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 17:35:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:28,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:28,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466818891] [2025-03-03 17:35:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466818891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:28,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902025483] [2025-03-03 17:35:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:28,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:28,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:28,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:28,575 INFO L87 Difference]: Start difference. First operand 553 states and 819 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:28,871 INFO L93 Difference]: Finished difference Result 1167 states and 1728 transitions. [2025-03-03 17:35:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:28,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2025-03-03 17:35:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:28,874 INFO L225 Difference]: With dead ends: 1167 [2025-03-03 17:35:28,874 INFO L226 Difference]: Without dead ends: 690 [2025-03-03 17:35:28,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:28,875 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1174 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:28,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 1956 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-03 17:35:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 554. [2025-03-03 17:35:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.481012658227848) internal successors, (819), 553 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 819 transitions. [2025-03-03 17:35:28,886 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 819 transitions. Word has length 74 [2025-03-03 17:35:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:28,886 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 819 transitions. [2025-03-03 17:35:28,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 819 transitions. [2025-03-03 17:35:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 17:35:28,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:28,887 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] [2025-03-03 17:35:28,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:35:28,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1063277450, now seen corresponding path program 1 times [2025-03-03 17:35:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504576909] [2025-03-03 17:35:28,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:28,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 17:35:28,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 17:35:28,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:28,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:29,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504576909] [2025-03-03 17:35:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504576909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:29,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:29,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:35:29,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143482264] [2025-03-03 17:35:29,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:29,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:35:29,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:29,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:35:29,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:29,418 INFO L87 Difference]: Start difference. First operand 554 states and 819 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:30,097 INFO L93 Difference]: Finished difference Result 1212 states and 1793 transitions. [2025-03-03 17:35:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:30,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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 75 [2025-03-03 17:35:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:30,100 INFO L225 Difference]: With dead ends: 1212 [2025-03-03 17:35:30,100 INFO L226 Difference]: Without dead ends: 735 [2025-03-03 17:35:30,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:35:30,102 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 1320 mSDsluCounter, 4021 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 4665 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:30,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 4665 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-03 17:35:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 599. [2025-03-03 17:35:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.4816053511705685) internal successors, (886), 598 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 886 transitions. [2025-03-03 17:35:30,116 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 886 transitions. Word has length 75 [2025-03-03 17:35:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:30,116 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 886 transitions. [2025-03-03 17:35:30,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 886 transitions. [2025-03-03 17:35:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 17:35:30,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:30,118 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] [2025-03-03 17:35:30,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:35:30,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:30,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash 295040261, now seen corresponding path program 1 times [2025-03-03 17:35:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972146869] [2025-03-03 17:35:30,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:30,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 17:35:30,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 17:35:30,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:30,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:35:30,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:35:30,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 17:35:30,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 17:35:30,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:30,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:35:30,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:35:30,337 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:35:30,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:35:30,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:35:30,342 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:30,393 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:35:30,412 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:35:30,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:35:30 BoogieIcfgContainer [2025-03-03 17:35:30,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:35:30,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:35:30,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:35:30,417 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:35:30,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:22" (3/4) ... [2025-03-03 17:35:30,419 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:35:30,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:35:30,420 INFO L158 Benchmark]: Toolchain (without parser) took 10488.40ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 112.0MB in the beginning and 396.2MB in the end (delta: -284.2MB). Peak memory consumption was 210.6MB. Max. memory is 16.1GB. [2025-03-03 17:35:30,421 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:30,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.19ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 75.1MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:35:30,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 163.56ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 81.9MB in the end (delta: -6.8MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2025-03-03 17:35:30,421 INFO L158 Benchmark]: Boogie Preprocessor took 193.31ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 59.1MB in the end (delta: 22.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:30,421 INFO L158 Benchmark]: IcfgBuilder took 1925.71ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 59.1MB in the beginning and 345.6MB in the end (delta: -286.5MB). Peak memory consumption was 239.3MB. Max. memory is 16.1GB. [2025-03-03 17:35:30,422 INFO L158 Benchmark]: TraceAbstraction took 7754.38ms. Allocated memory was 427.8MB in the beginning and 637.5MB in the end (delta: 209.7MB). Free memory was 342.0MB in the beginning and 396.2MB in the end (delta: -54.2MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. [2025-03-03 17:35:30,422 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 637.5MB. Free memory was 396.2MB in the beginning and 396.2MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:30,423 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.14ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.19ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 75.1MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 163.56ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 81.9MB in the end (delta: -6.8MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 193.31ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 59.1MB in the end (delta: 22.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1925.71ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 59.1MB in the beginning and 345.6MB in the end (delta: -286.5MB). Peak memory consumption was 239.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7754.38ms. Allocated memory was 427.8MB in the beginning and 637.5MB in the end (delta: 209.7MB). Free memory was 342.0MB in the beginning and 396.2MB in the end (delta: -54.2MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 637.5MB. Free memory was 396.2MB in the beginning and 396.2MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 263, overapproximation of bitwiseAnd at line 159. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 32); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (32 - 1); [L35] const SORT_36 mask_SORT_36 = (SORT_36)-1 >> (sizeof(SORT_36) * 8 - 3); [L36] const SORT_36 msb_SORT_36 = (SORT_36)1 << (3 - 1); [L38] const SORT_206 mask_SORT_206 = (SORT_206)-1 >> (sizeof(SORT_206) * 8 - 2); [L39] const SORT_206 msb_SORT_206 = (SORT_206)1 << (2 - 1); [L41] const SORT_1 var_10 = 0; [L42] const SORT_13 var_15 = 4; [L43] const SORT_5 var_22 = 1; [L44] const SORT_36 var_38 = 1; [L45] const SORT_36 var_43 = 2; [L46] const SORT_36 var_50 = 4; [L47] const SORT_36 var_53 = 3; [L48] const SORT_13 var_81 = 1; [L49] const SORT_13 var_101 = 0; [L50] const SORT_5 var_149 = 0; [L51] const SORT_1 var_186 = 15; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L55] SORT_1 input_4; [L56] SORT_5 input_6; [L57] SORT_1 input_7; [L58] SORT_5 input_8; [L59] SORT_5 input_9; [L60] SORT_13 input_94; [L61] SORT_1 input_96; [L62] SORT_1 input_107; [L63] SORT_1 input_112; [L64] SORT_1 input_114; [L65] SORT_1 input_129; [L66] SORT_5 input_140; [L67] SORT_5 input_144; [L68] SORT_5 input_147; [L69] SORT_5 input_152; [L70] SORT_5 input_155; [L71] SORT_5 input_158; [L72] SORT_1 input_173; [L73] SORT_1 input_176; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L75] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L76] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L77] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L78] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L79] SORT_5 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L80] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L81] SORT_1 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L82] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L83] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L84] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L85] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L86] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L87] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L88] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L89] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] SORT_1 init_12_arg_1 = var_10; [L92] state_11 = init_12_arg_1 [L93] SORT_1 init_18_arg_1 = var_10; [L94] state_17 = init_18_arg_1 [L95] SORT_1 init_20_arg_1 = var_10; [L96] state_19 = init_20_arg_1 [L97] SORT_5 init_24_arg_1 = var_22; [L98] state_23 = init_24_arg_1 [L99] SORT_5 init_29_arg_1 = var_22; [L100] state_28 = init_29_arg_1 [L101] SORT_1 init_33_arg_1 = var_10; [L102] state_32 = init_33_arg_1 [L103] SORT_1 init_35_arg_1 = var_10; [L104] state_34 = init_35_arg_1 [L105] SORT_1 init_42_arg_1 = var_10; [L106] state_41 = init_42_arg_1 [L107] SORT_1 init_47_arg_1 = var_10; [L108] state_46 = init_47_arg_1 [L109] SORT_1 init_49_arg_1 = var_10; [L110] state_48 = init_49_arg_1 [L111] SORT_1 init_58_arg_1 = var_10; [L112] state_57 = init_58_arg_1 [L113] SORT_1 init_60_arg_1 = var_10; [L114] state_59 = init_60_arg_1 [L115] SORT_1 init_64_arg_1 = var_10; [L116] state_63 = init_64_arg_1 [L117] SORT_1 init_66_arg_1 = var_10; [L118] state_65 = init_66_arg_1 [L119] SORT_1 init_71_arg_1 = var_10; [L120] state_70 = init_71_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L123] input_2 = __VERIFIER_nondet_uchar() [L124] input_3 = __VERIFIER_nondet_uchar() [L125] input_4 = __VERIFIER_nondet_uchar() [L126] input_6 = __VERIFIER_nondet_uchar() [L127] input_7 = __VERIFIER_nondet_uchar() [L128] input_8 = __VERIFIER_nondet_uchar() [L129] input_9 = __VERIFIER_nondet_uchar() [L130] input_94 = __VERIFIER_nondet_uint() [L131] input_96 = __VERIFIER_nondet_uchar() [L132] input_107 = __VERIFIER_nondet_uchar() [L133] input_112 = __VERIFIER_nondet_uchar() [L134] input_114 = __VERIFIER_nondet_uchar() [L135] input_129 = __VERIFIER_nondet_uchar() [L136] input_140 = __VERIFIER_nondet_uchar() [L137] input_144 = __VERIFIER_nondet_uchar() [L138] input_147 = __VERIFIER_nondet_uchar() [L139] input_152 = __VERIFIER_nondet_uchar() [L140] input_155 = __VERIFIER_nondet_uchar() [L141] input_158 = __VERIFIER_nondet_uchar() [L142] input_173 = __VERIFIER_nondet_uchar() [L143] input_176 = __VERIFIER_nondet_uchar() [L146] SORT_1 var_14_arg_0 = state_11; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_14_arg_0=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L147] EXPR var_14_arg_0 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L147] var_14_arg_0 = var_14_arg_0 & mask_SORT_1 [L148] SORT_13 var_14 = var_14_arg_0; [L149] SORT_13 var_16_arg_0 = var_14; [L150] SORT_13 var_16_arg_1 = var_15; [L151] SORT_5 var_16 = var_16_arg_0 == var_16_arg_1; [L152] SORT_1 var_21_arg_0 = state_17; [L153] SORT_1 var_21_arg_1 = state_19; [L154] SORT_5 var_21 = var_21_arg_0 == var_21_arg_1; [L155] SORT_5 var_25_arg_0 = state_23; [L156] SORT_5 var_25 = ~var_25_arg_0; [L157] SORT_5 var_26_arg_0 = var_21; [L158] SORT_5 var_26_arg_1 = var_25; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26_arg_0=1, var_26_arg_1=-2, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L159] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L159] SORT_5 var_26 = var_26_arg_0 & var_26_arg_1; [L160] EXPR var_26 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L160] var_26 = var_26 & mask_SORT_5 [L161] SORT_5 var_27_arg_0 = var_16; [L162] SORT_5 var_27_arg_1 = var_26; [L163] SORT_5 var_27 = var_27_arg_0 == var_27_arg_1; [L164] SORT_5 var_30_arg_0 = state_28; [L165] SORT_5 var_30_arg_1 = state_23; [L166] SORT_5 var_30 = var_30_arg_0 == var_30_arg_1; [L167] SORT_5 var_31_arg_0 = var_27; [L168] SORT_5 var_31_arg_1 = var_30; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31_arg_0=0, var_31_arg_1=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L169] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L169] SORT_5 var_31 = var_31_arg_0 & var_31_arg_1; [L170] SORT_1 var_37_arg_0 = state_11; [L171] SORT_36 var_37 = var_37_arg_0 >> 0; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L172] EXPR var_37 & mask_SORT_36 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L172] var_37 = var_37 & mask_SORT_36 [L173] SORT_36 var_54_arg_0 = var_37; [L174] SORT_36 var_54_arg_1 = var_53; [L175] SORT_5 var_54 = var_54_arg_0 == var_54_arg_1; [L176] SORT_36 var_51_arg_0 = var_37; [L177] SORT_36 var_51_arg_1 = var_50; [L178] SORT_5 var_51 = var_51_arg_0 == var_51_arg_1; [L179] SORT_5 var_55_arg_0 = var_54; [L180] SORT_5 var_55_arg_1 = var_51; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_55_arg_0=0, var_55_arg_1=0, var_81=1] [L181] EXPR var_55_arg_0 | var_55_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_81=1] [L181] SORT_5 var_55 = var_55_arg_0 | var_55_arg_1; [L182] EXPR var_55 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_81=1] [L182] var_55 = var_55 & mask_SORT_5 [L183] SORT_5 var_52_arg_0 = var_51; [L184] SORT_1 var_52_arg_1 = state_48; [L185] SORT_1 var_52_arg_2 = state_46; [L186] SORT_1 var_52 = var_52_arg_0 ? var_52_arg_1 : var_52_arg_2; [L187] SORT_36 var_44_arg_0 = var_37; [L188] SORT_36 var_44_arg_1 = var_43; [L189] SORT_5 var_44 = var_44_arg_0 == var_44_arg_1; [L190] SORT_36 var_39_arg_0 = var_37; [L191] SORT_36 var_39_arg_1 = var_38; [L192] SORT_5 var_39 = var_39_arg_0 == var_39_arg_1; [L193] SORT_5 var_40_arg_0 = var_39; [L194] SORT_1 var_40_arg_1 = state_34; [L195] SORT_1 var_40_arg_2 = state_32; [L196] SORT_1 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L197] SORT_5 var_45_arg_0 = var_44; [L198] SORT_1 var_45_arg_1 = state_41; [L199] SORT_1 var_45_arg_2 = var_40; [L200] SORT_1 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L201] SORT_5 var_56_arg_0 = var_55; [L202] SORT_1 var_56_arg_1 = var_52; [L203] SORT_1 var_56_arg_2 = var_45; [L204] SORT_1 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L205] EXPR var_56 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L205] var_56 = var_56 & mask_SORT_1 [L206] SORT_1 var_75_arg_0 = state_17; [L207] SORT_5 var_75 = var_75_arg_0 >> 2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_75=0, var_81=1] [L208] EXPR var_75 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L208] var_75 = var_75 & mask_SORT_5 [L209] SORT_1 var_68_arg_0 = state_17; [L210] SORT_5 var_68 = var_68_arg_0 >> 1; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_68=0, var_75=0, var_81=1] [L211] EXPR var_68 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_75=0, var_81=1] [L211] var_68 = var_68 & mask_SORT_5 [L212] SORT_1 var_61_arg_0 = state_17; [L213] SORT_5 var_61 = var_61_arg_0 >> 0; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_61=0, var_68=0, var_75=0, var_81=1] [L214] EXPR var_61 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_68=0, var_75=0, var_81=1] [L214] var_61 = var_61 & mask_SORT_5 [L215] SORT_5 var_73_arg_0 = var_61; [L216] SORT_1 var_73_arg_1 = input_4; [L217] SORT_1 var_73_arg_2 = input_3; [L218] SORT_1 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L219] SORT_5 var_72_arg_0 = var_61; [L220] SORT_1 var_72_arg_1 = input_2; [L221] SORT_1 var_72_arg_2 = state_70; [L222] SORT_1 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L223] SORT_5 var_74_arg_0 = var_68; [L224] SORT_1 var_74_arg_1 = var_73; [L225] SORT_1 var_74_arg_2 = var_72; [L226] SORT_1 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L227] SORT_5 var_67_arg_0 = var_61; [L228] SORT_1 var_67_arg_1 = state_65; [L229] SORT_1 var_67_arg_2 = state_63; [L230] SORT_1 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L231] SORT_5 var_62_arg_0 = var_61; [L232] SORT_1 var_62_arg_1 = state_59; [L233] SORT_1 var_62_arg_2 = state_57; [L234] SORT_1 var_62 = var_62_arg_0 ? var_62_arg_1 : var_62_arg_2; [L235] SORT_5 var_69_arg_0 = var_68; [L236] SORT_1 var_69_arg_1 = var_67; [L237] SORT_1 var_69_arg_2 = var_62; [L238] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L239] SORT_5 var_76_arg_0 = var_75; [L240] SORT_1 var_76_arg_1 = var_74; [L241] SORT_1 var_76_arg_2 = var_69; [L242] SORT_1 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_76=0, var_81=1] [L243] EXPR var_76 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L243] var_76 = var_76 & mask_SORT_1 [L244] SORT_1 var_77_arg_0 = var_56; [L245] SORT_1 var_77_arg_1 = var_76; [L246] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L247] SORT_5 var_78_arg_0 = state_28; [L248] SORT_5 var_78_arg_1 = var_77; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_78_arg_0=1, var_78_arg_1=1, var_81=1] [L249] EXPR var_78_arg_0 | var_78_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L249] SORT_5 var_78 = var_78_arg_0 | var_78_arg_1; [L250] SORT_5 var_79_arg_0 = var_31; [L251] SORT_5 var_79_arg_1 = var_78; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_79_arg_0=0, var_79_arg_1=1, var_81=1] [L252] EXPR var_79_arg_0 & var_79_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L252] SORT_5 var_79 = var_79_arg_0 & var_79_arg_1; [L253] SORT_5 var_80_arg_0 = var_79; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_80_arg_0=0, var_81=1] [L254] EXPR var_80_arg_0 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L254] var_80_arg_0 = var_80_arg_0 & mask_SORT_5 [L255] SORT_13 var_80 = var_80_arg_0; [L256] SORT_13 var_82_arg_0 = var_80; [L257] SORT_13 var_82_arg_1 = var_81; [L258] SORT_5 var_82 = var_82_arg_0 == var_82_arg_1; [L259] SORT_5 var_85_arg_0 = var_82; [L260] SORT_5 var_85 = ~var_85_arg_0; [L261] SORT_5 var_86_arg_0 = var_22; [L262] SORT_5 var_86_arg_1 = var_85; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1, var_86_arg_0=1, var_86_arg_1=-1] [L263] EXPR var_86_arg_0 & var_86_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L263] SORT_5 var_86 = var_86_arg_0 & var_86_arg_1; [L264] EXPR var_86 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L264] var_86 = var_86 & mask_SORT_5 [L265] SORT_5 bad_87_arg_0 = var_86; [L266] CALL __VERIFIER_assert(!(bad_87_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 538 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6360 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6360 mSDsluCounter, 18129 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13594 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4545 IncrementalHoareTripleChecker+Invalid, 4588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 4535 mSDtfsCounter, 4545 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=599occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 607 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 1662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:35:30,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.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 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:32,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:32,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:35:32,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:32,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:32,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:32,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:32,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:32,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:32,484 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:32,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:32,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:32,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:32,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:32,485 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:32,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:32,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:32,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:32,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:32,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:32,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:32,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:32,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:32,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:32,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:32,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:32,488 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 -> 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 [2025-03-03 17:35:32,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:32,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:32,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:32,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:32,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:32,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2025-03-03 17:35:33,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf831f76/983f7ed2cd9f453eb053b8f29e1794df/FLAGf796df4c0 [2025-03-03 17:35:34,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:34,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2025-03-03 17:35:34,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf831f76/983f7ed2cd9f453eb053b8f29e1794df/FLAGf796df4c0 [2025-03-03 17:35:34,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf831f76/983f7ed2cd9f453eb053b8f29e1794df [2025-03-03 17:35:34,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:34,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:34,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:34,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:34,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:34,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6fe588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34, skipping insertion in model container [2025-03-03 17:35:34,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:34,328 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.h_FIFO.c[1246,1259] [2025-03-03 17:35:34,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:34,506 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:34,514 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.h_FIFO.c[1246,1259] [2025-03-03 17:35:34,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:34,592 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:34,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34 WrapperNode [2025-03-03 17:35:34,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:34,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:34,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:34,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:34,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,659 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 877 [2025-03-03 17:35:34,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:34,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:34,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:34,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:34,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,699 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:35:34,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:34,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:34,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:34,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:34,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (1/1) ... [2025-03-03 17:35:34,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:34,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:34,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:35:34,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:35:34,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:35:34,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:34,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:35,010 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:35,012 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:35,695 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:35,695 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:35,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:35,703 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:35,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:35 BoogieIcfgContainer [2025-03-03 17:35:35,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:35,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:35,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:35,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:35,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:34" (1/3) ... [2025-03-03 17:35:35,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44048589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:35, skipping insertion in model container [2025-03-03 17:35:35,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:34" (2/3) ... [2025-03-03 17:35:35,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44048589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:35, skipping insertion in model container [2025-03-03 17:35:35,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:35" (3/3) ... [2025-03-03 17:35:35,714 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FIFO.c [2025-03-03 17:35:35,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:35,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_FIFO.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:35,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:35,778 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;@1d398706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:35,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:35:35,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:35,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:35:35,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:35,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:35,791 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:35:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:35:35,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [727765439] [2025-03-03 17:35:35,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:35:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:35,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:35:35,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:35:36,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:35:36,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:35:36,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:36,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:36,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 17:35:36,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:35:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:36,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:35:36,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:35:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727765439] [2025-03-03 17:35:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727765439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890300588] [2025-03-03 17:35:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:36,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:36,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:35:36,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:36,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:36,427 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:36,498 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:35:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 17:35:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:36,504 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:35:36,504 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:35:36,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:36,509 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:36,510 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.0s Time] [2025-03-03 17:35:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:35:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:35:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:35:36,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:35:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:36,529 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:35:36,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:35:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:35:36,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:36,529 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:36,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:35:36,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:35:36,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:35:36,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:35:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728441167] [2025-03-03 17:35:36,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:36,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:35:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:36,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:35:36,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:35:36,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:35:37,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:35:37,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:37,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:37,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-03 17:35:37,051 INFO L279 TraceCheckSpWp]: Computing forward predicates...