./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:13:36,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:13:36,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:13:36,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:13:36,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:13:36,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:13:36,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:13:36,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:13:36,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:13:36,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:13:36,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:13:36,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:13:36,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:13:36,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:13:36,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:13:36,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:13:36,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:13:36,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 [2025-02-07 23:13:36,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:13:36,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:13:36,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:13:36,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:13:36,363 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:13:36,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2025-02-07 23:13:37,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ac931b47/b9ca460a71604e6194c7451a9289acd8/FLAG59d2f163d [2025-02-07 23:13:37,893 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:13:37,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2025-02-07 23:13:37,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ac931b47/b9ca460a71604e6194c7451a9289acd8/FLAG59d2f163d [2025-02-07 23:13:38,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ac931b47/b9ca460a71604e6194c7451a9289acd8 [2025-02-07 23:13:38,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:13:38,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:13:38,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:13:38,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:13:38,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:13:38,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:38,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd3e168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38, skipping insertion in model container [2025-02-07 23:13:38,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:38,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:13:38,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c[1246,1259] [2025-02-07 23:13:38,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:13:38,511 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:13:38,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c[1246,1259] [2025-02-07 23:13:38,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:13:38,591 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:13:38,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38 WrapperNode [2025-02-07 23:13:38,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:13:38,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:13:38,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:13:38,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:13:38,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:38,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:38,773 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1933 [2025-02-07 23:13:38,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:13:38,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:13:38,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:13:38,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:13:38,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:38,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:38,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:38,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 23:13:38,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:38,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:39,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:39,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:39,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:39,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:39,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:13:39,068 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:13:39,068 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:13:39,068 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:13:39,069 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (1/1) ... [2025-02-07 23:13:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:13:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:13:39,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:13:39,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:13:39,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:13:39,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:13:39,307 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:13:39,308 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:13:40,715 INFO L? ?]: Removed 1107 outVars from TransFormulas that were not future-live. [2025-02-07 23:13:40,715 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:13:40,802 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:13:40,804 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:13:40,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:40 BoogieIcfgContainer [2025-02-07 23:13:40,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:13:40,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:13:40,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:13:40,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:13:40,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:13:38" (1/3) ... [2025-02-07 23:13:40,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e53cafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:40, skipping insertion in model container [2025-02-07 23:13:40,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:38" (2/3) ... [2025-02-07 23:13:40,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e53cafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:40, skipping insertion in model container [2025-02-07 23:13:40,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:40" (3/3) ... [2025-02-07 23:13:40,813 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FIFO.c [2025-02-07 23:13:40,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:13:40,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_FIFO.c that has 1 procedures, 536 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:13:40,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:13:40,899 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;@3715ca4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:13:40,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:13:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 536 states, 534 states have (on average 1.5) internal successors, (801), 535 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-07 23:13:40,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:40,914 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] [2025-02-07 23:13:40,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:40,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:40,918 INFO L85 PathProgramCache]: Analyzing trace with hash -658503372, now seen corresponding path program 1 times [2025-02-07 23:13:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:40,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387215467] [2025-02-07 23:13:40,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:41,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-07 23:13:41,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-07 23:13:41,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:41,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:41,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:41,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387215467] [2025-02-07 23:13:41,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387215467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:41,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:13:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159156451] [2025-02-07 23:13:41,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:41,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:13:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:41,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:13:41,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:41,975 INFO L87 Difference]: Start difference. First operand has 536 states, 534 states have (on average 1.5) internal successors, (801), 535 states have internal predecessors, (801), 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.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:42,267 INFO L93 Difference]: Finished difference Result 1009 states and 1510 transitions. [2025-02-07 23:13:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:13:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2025-02-07 23:13:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:42,276 INFO L225 Difference]: With dead ends: 1009 [2025-02-07 23:13:42,277 INFO L226 Difference]: Without dead ends: 534 [2025-02-07 23:13:42,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:13:42,281 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 737 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1308 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.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:42,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1308 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:13:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-07 23:13:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-02-07 23:13:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.4934333958724202) internal successors, (796), 533 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 796 transitions. [2025-02-07 23:13:42,330 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 796 transitions. Word has length 68 [2025-02-07 23:13:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:42,331 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 796 transitions. [2025-02-07 23:13:42,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 796 transitions. [2025-02-07 23:13:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 23:13:42,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:42,334 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] [2025-02-07 23:13:42,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:13:42,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:42,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash 127451296, now seen corresponding path program 1 times [2025-02-07 23:13:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:42,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974709422] [2025-02-07 23:13:42,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:42,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 23:13:42,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 23:13:42,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:42,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974709422] [2025-02-07 23:13:42,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974709422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:42,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:42,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881803277] [2025-02-07 23:13:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:42,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:13:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:42,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:13:42,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:42,662 INFO L87 Difference]: Start difference. First operand 534 states and 796 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:42,912 INFO L93 Difference]: Finished difference Result 538 states and 800 transitions. [2025-02-07 23:13:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:13:42,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2025-02-07 23:13:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:42,915 INFO L225 Difference]: With dead ends: 538 [2025-02-07 23:13:42,915 INFO L226 Difference]: Without dead ends: 536 [2025-02-07 23:13:42,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:42,916 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 0 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1981 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-02-07 23:13:42,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1981 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:13:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-07 23:13:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-07 23:13:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.4915887850467289) internal successors, (798), 535 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 798 transitions. [2025-02-07 23:13:42,943 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 798 transitions. Word has length 70 [2025-02-07 23:13:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 798 transitions. [2025-02-07 23:13:42,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 798 transitions. [2025-02-07 23:13:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-07 23:13:42,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:42,945 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-02-07 23:13:42,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:13:42,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:42,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash -339297277, now seen corresponding path program 1 times [2025-02-07 23:13:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:42,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911333719] [2025-02-07 23:13:42,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:42,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:42,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 23:13:43,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 23:13:43,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:43,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:43,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911333719] [2025-02-07 23:13:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911333719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:43,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:43,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763565961] [2025-02-07 23:13:43,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:43,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:13:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:43,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:13:43,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:13:43,657 INFO L87 Difference]: Start difference. First operand 536 states and 798 transitions. Second operand has 5 states, 5 states have (on average 14.2) 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-02-07 23:13:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:44,023 INFO L93 Difference]: Finished difference Result 1142 states and 1696 transitions. [2025-02-07 23:13:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:13:44,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) 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-02-07 23:13:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:44,027 INFO L225 Difference]: With dead ends: 1142 [2025-02-07 23:13:44,027 INFO L226 Difference]: Without dead ends: 667 [2025-02-07 23:13:44,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-07 23:13:44,028 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 1141 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:44,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 1933 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:13:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-07 23:13:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 542. [2025-02-07 23:13:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.489833641404806) internal successors, (806), 541 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 806 transitions. [2025-02-07 23:13:44,049 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 806 transitions. Word has length 71 [2025-02-07 23:13:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:44,049 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 806 transitions. [2025-02-07 23:13:44,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) 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-02-07 23:13:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 806 transitions. [2025-02-07 23:13:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-07 23:13:44,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:44,052 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-02-07 23:13:44,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:13:44,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:44,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:44,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1829609699, now seen corresponding path program 1 times [2025-02-07 23:13:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:44,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566527754] [2025-02-07 23:13:44,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:44,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-07 23:13:44,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-07 23:13:44,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:44,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:44,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:44,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566527754] [2025-02-07 23:13:44,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566527754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:44,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:44,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:13:44,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652855611] [2025-02-07 23:13:44,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:44,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:13:44,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:44,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:13:44,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:13:44,348 INFO L87 Difference]: Start difference. First operand 542 states and 806 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-02-07 23:13:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:45,012 INFO L93 Difference]: Finished difference Result 1410 states and 2099 transitions. [2025-02-07 23:13:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:13:45,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-02-07 23:13:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:45,019 INFO L225 Difference]: With dead ends: 1410 [2025-02-07 23:13:45,019 INFO L226 Difference]: Without dead ends: 546 [2025-02-07 23:13:45,020 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-02-07 23:13:45,024 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 509 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 2965 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-02-07 23:13:45,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 2965 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:13:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-02-07 23:13:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2025-02-07 23:13:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4880294659300184) internal successors, (808), 543 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 808 transitions. [2025-02-07 23:13:45,047 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 808 transitions. Word has length 72 [2025-02-07 23:13:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:45,047 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 808 transitions. [2025-02-07 23:13:45,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-02-07 23:13:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 808 transitions. [2025-02-07 23:13:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 23:13:45,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:45,048 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-02-07 23:13:45,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:13:45,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:45,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 768025444, now seen corresponding path program 1 times [2025-02-07 23:13:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:45,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283347767] [2025-02-07 23:13:45,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:45,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:45,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 23:13:45,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 23:13:45,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:46,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283347767] [2025-02-07 23:13:46,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283347767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:46,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:46,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:13:46,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283731075] [2025-02-07 23:13:46,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:46,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:13:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:46,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:13:46,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:13:46,121 INFO L87 Difference]: Start difference. First operand 544 states and 808 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-02-07 23:13:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:46,587 INFO L93 Difference]: Finished difference Result 1237 states and 1827 transitions. [2025-02-07 23:13:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:13:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-02-07 23:13:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:46,590 INFO L225 Difference]: With dead ends: 1237 [2025-02-07 23:13:46,590 INFO L226 Difference]: Without dead ends: 760 [2025-02-07 23:13:46,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-02-07 23:13:46,594 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 1479 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:46,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 2818 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:13:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-02-07 23:13:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 552. [2025-02-07 23:13:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.484573502722323) internal successors, (818), 551 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 818 transitions. [2025-02-07 23:13:46,611 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 818 transitions. Word has length 73 [2025-02-07 23:13:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:46,611 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 818 transitions. [2025-02-07 23:13:46,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-02-07 23:13:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 818 transitions. [2025-02-07 23:13:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 23:13:46,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:46,612 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-02-07 23:13:46,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:13:46,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:46,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:46,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1243090808, now seen corresponding path program 1 times [2025-02-07 23:13:46,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:46,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903295927] [2025-02-07 23:13:46,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:46,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:46,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 23:13:46,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 23:13:46,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:46,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:46,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:46,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903295927] [2025-02-07 23:13:46,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903295927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:46,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:46,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525275931] [2025-02-07 23:13:46,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:46,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:13:46,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:46,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:13:46,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:13:46,907 INFO L87 Difference]: Start difference. First operand 552 states and 818 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 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-02-07 23:13:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:47,208 INFO L93 Difference]: Finished difference Result 1166 states and 1727 transitions. [2025-02-07 23:13:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:13:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 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-02-07 23:13:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:47,210 INFO L225 Difference]: With dead ends: 1166 [2025-02-07 23:13:47,211 INFO L226 Difference]: Without dead ends: 689 [2025-02-07 23:13:47,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-07 23:13:47,212 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1174 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1952 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-02-07 23:13:47,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 1952 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:13:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-07 23:13:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 553. [2025-02-07 23:13:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4818840579710144) internal successors, (818), 552 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 818 transitions. [2025-02-07 23:13:47,224 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 818 transitions. Word has length 73 [2025-02-07 23:13:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:47,224 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 818 transitions. [2025-02-07 23:13:47,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 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-02-07 23:13:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 818 transitions. [2025-02-07 23:13:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 23:13:47,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:47,225 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-02-07 23:13:47,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:13:47,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:47,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1552542810, now seen corresponding path program 1 times [2025-02-07 23:13:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:47,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861819545] [2025-02-07 23:13:47,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:47,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:47,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 23:13:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 23:13:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:47,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:47,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861819545] [2025-02-07 23:13:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861819545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:47,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:47,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:13:47,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596881129] [2025-02-07 23:13:47,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:47,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 23:13:47,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:47,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 23:13:47,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:13:47,928 INFO L87 Difference]: Start difference. First operand 553 states and 818 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 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-02-07 23:13:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:48,730 INFO L93 Difference]: Finished difference Result 1209 states and 1789 transitions. [2025-02-07 23:13:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:13:48,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 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-02-07 23:13:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:48,732 INFO L225 Difference]: With dead ends: 1209 [2025-02-07 23:13:48,733 INFO L226 Difference]: Without dead ends: 732 [2025-02-07 23:13:48,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-02-07 23:13:48,734 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 1279 mSDsluCounter, 5124 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 5765 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:48,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 5765 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:13:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-07 23:13:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 598. [2025-02-07 23:13:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4824120603015076) internal successors, (885), 597 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 885 transitions. [2025-02-07 23:13:48,745 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 885 transitions. Word has length 74 [2025-02-07 23:13:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:48,746 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 885 transitions. [2025-02-07 23:13:48,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 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-02-07 23:13:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 885 transitions. [2025-02-07 23:13:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 23:13:48,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:48,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-02-07 23:13:48,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:13:48,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:48,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1974187297, now seen corresponding path program 1 times [2025-02-07 23:13:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244758353] [2025-02-07 23:13:48,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:48,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 23:13:48,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 23:13:48,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:48,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:13:48,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:13:48,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 23:13:48,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 23:13:48,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:48,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:13:48,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:13:48,939 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:13:48,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:13:48,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:13:48,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:13:48,997 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:13:49,017 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:13:49,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:13:49 BoogieIcfgContainer [2025-02-07 23:13:49,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:13:49,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:13:49,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:13:49,027 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:13:49,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:40" (3/4) ... [2025-02-07 23:13:49,029 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:13:49,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:13:49,034 INFO L158 Benchmark]: Toolchain (without parser) took 10846.21ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 122.6MB in the beginning and 187.8MB in the end (delta: -65.2MB). Peak memory consumption was 358.3MB. Max. memory is 16.1GB. [2025-02-07 23:13:49,034 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:13:49,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.84ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 85.7MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 23:13:49,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 181.16ms. Allocated memory is still 167.8MB. Free memory was 85.7MB in the beginning and 41.3MB in the end (delta: 44.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 23:13:49,035 INFO L158 Benchmark]: Boogie Preprocessor took 292.67ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 41.3MB in the beginning and 103.9MB in the end (delta: -62.6MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2025-02-07 23:13:49,035 INFO L158 Benchmark]: IcfgBuilder took 1736.80ms. Allocated memory was 176.2MB in the beginning and 377.5MB in the end (delta: 201.3MB). Free memory was 103.7MB in the beginning and 177.5MB in the end (delta: -73.8MB). Peak memory consumption was 138.6MB. Max. memory is 16.1GB. [2025-02-07 23:13:49,035 INFO L158 Benchmark]: TraceAbstraction took 8220.37ms. Allocated memory was 377.5MB in the beginning and 587.2MB in the end (delta: 209.7MB). Free memory was 176.6MB in the beginning and 187.8MB in the end (delta: -11.3MB). Peak memory consumption was 194.5MB. Max. memory is 16.1GB. [2025-02-07 23:13:49,035 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 587.2MB. Free memory was 187.8MB in the beginning and 187.8MB in the end (delta: 38.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:13:49,036 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.29ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.84ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 85.7MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 181.16ms. Allocated memory is still 167.8MB. Free memory was 85.7MB in the beginning and 41.3MB in the end (delta: 44.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 292.67ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 41.3MB in the beginning and 103.9MB in the end (delta: -62.6MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * IcfgBuilder took 1736.80ms. Allocated memory was 176.2MB in the beginning and 377.5MB in the end (delta: 201.3MB). Free memory was 103.7MB in the beginning and 177.5MB in the end (delta: -73.8MB). Peak memory consumption was 138.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8220.37ms. Allocated memory was 377.5MB in the beginning and 587.2MB in the end (delta: 209.7MB). Free memory was 176.6MB in the beginning and 187.8MB in the end (delta: -11.3MB). Peak memory consumption was 194.5MB. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 587.2MB. Free memory was 187.8MB in the beginning and 187.8MB in the end (delta: 38.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 159, overapproximation of bitwiseAnd at line 263. 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, 536 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6319 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6319 mSDsluCounter, 18722 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14195 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4707 IncrementalHoareTripleChecker+Invalid, 4752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 4527 mSDtfsCounter, 4707 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=598occurred in iteration=7, InterpolantAutomatonStates: 47, 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, 605 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 494 ConstructedInterpolants, 0 QuantifiedInterpolants, 1612 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-02-07 23:13:49,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:13:51,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:13:51,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:13:51,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:13:51,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:13:51,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:13:51,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:13:51,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:13:51,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:13:51,185 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:13:51,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:13:51,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:13:51,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:13:51,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:13:51,187 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:13:51,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:13:51,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:13:51,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:13:51,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:13:51,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:13:51,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:13:51,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:13:51,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:13:51,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:13:51,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:13:51,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:13:51,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:13:51,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:13:51,189 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:13:51,189 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:13:51,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:13:51,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:13:51,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:13:51,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:13:51,190 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 [2025-02-07 23:13:51,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:13:51,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:13:51,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:13:51,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:13:51,457 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:13:51,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2025-02-07 23:13:52,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cd08efa5/7226f9a7e6934d8fbacc368778d75892/FLAGd2769025b [2025-02-07 23:13:52,992 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:13:52,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2025-02-07 23:13:53,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cd08efa5/7226f9a7e6934d8fbacc368778d75892/FLAGd2769025b [2025-02-07 23:13:53,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cd08efa5/7226f9a7e6934d8fbacc368778d75892 [2025-02-07 23:13:53,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:13:53,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:13:53,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:13:53,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:13:53,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:13:53,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71159dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53, skipping insertion in model container [2025-02-07 23:13:53,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:13:53,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c[1246,1259] [2025-02-07 23:13:53,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:13:53,539 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:13:53,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c[1246,1259] [2025-02-07 23:13:53,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:13:53,609 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:13:53,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53 WrapperNode [2025-02-07 23:13:53,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:13:53,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:13:53,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:13:53,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:13:53,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,663 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 877 [2025-02-07 23:13:53,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:13:53,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:13:53,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:13:53,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:13:53,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,686 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 23:13:53,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:13:53,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:13:53,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:13:53,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:13:53,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:13:53,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:13:53,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:13:53,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:13:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:13:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:13:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:13:53,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:13:53,968 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:13:53,969 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:13:54,634 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-02-07 23:13:54,634 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:13:54,640 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:13:54,641 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:13:54,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:54 BoogieIcfgContainer [2025-02-07 23:13:54,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:13:54,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:13:54,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:13:54,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:13:54,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:13:53" (1/3) ... [2025-02-07 23:13:54,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9068b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:54, skipping insertion in model container [2025-02-07 23:13:54,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (2/3) ... [2025-02-07 23:13:54,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9068b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:54, skipping insertion in model container [2025-02-07 23:13:54,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:54" (3/3) ... [2025-02-07 23:13:54,649 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FIFO.c [2025-02-07 23:13:54,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:13:54,660 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_FIFO.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:13:54,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:13:54,732 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;@38c98ae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:13:54,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:13:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:13:54,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:54,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:13:54,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:54,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:13:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:13:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727772988] [2025-02-07 23:13:54,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:54,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:13:54,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:13:54,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:13:54,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 23:13:54,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:13:54,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:13:54,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:54,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:54,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-07 23:13:54,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:13:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:13:55,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:13:55,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:13:55,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727772988] [2025-02-07 23:13:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727772988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:55,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:55,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:13:55,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412692447] [2025-02-07 23:13:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:13:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:13:55,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:13:55,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:55,300 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:55,370 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 23:13:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:13:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-07 23:13:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:55,377 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:13:55,377 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 23:13:55,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:13:55,380 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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-02-07 23:13:55,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:13:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 23:13:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 23:13:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:13:55,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:13:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:55,400 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:13:55,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:13:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:13:55,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:55,401 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:13:55,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:13:55,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:13:55,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:55,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:13:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:13:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532021002] [2025-02-07 23:13:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:55,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:13:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:13:55,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:13:55,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 23:13:55,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:13:55,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:13:55,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:55,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:55,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-02-07 23:13:55,951 INFO L279 TraceCheckSpWp]: Computing forward predicates...