./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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.cal2.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 e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:37:05,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:37:05,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:37:05,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:37:05,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:37:06,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:37:06,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:37:06,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:37:06,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:37:06,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:37:06,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:37:06,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:37:06,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:37:06,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:37:06,036 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:37:06,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:37:06,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:37:06,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:37:06,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:37:06,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:37:06,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:37:06,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:37:06,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:37:06,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:37:06,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:37:06,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:37:06,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:37:06,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:37:06,046 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 -> e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec [2025-02-05 18:37:06,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:37:06,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:37:06,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:37:06,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:37:06,377 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:37:06,379 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.cal2.c [2025-02-05 18:37:07,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90b54893c/c48e1fa17a964edc88949eecae25b044/FLAG412fad843 [2025-02-05 18:37:07,708 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:37:07,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2025-02-05 18:37:07,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90b54893c/c48e1fa17a964edc88949eecae25b044/FLAG412fad843 [2025-02-05 18:37:07,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90b54893c/c48e1fa17a964edc88949eecae25b044 [2025-02-05 18:37:07,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:37:07,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:37:07,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:37:07,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:37:07,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:37:07,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:37:07" (1/1) ... [2025-02-05 18:37:07,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a707027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:07, skipping insertion in model container [2025-02-05 18:37:07,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:37:07" (1/1) ... [2025-02-05 18:37:07,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:37:07,901 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.cal2.c[1244,1257] [2025-02-05 18:37:08,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:37:08,119 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:37:08,127 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.cal2.c[1244,1257] [2025-02-05 18:37:08,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:37:08,236 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:37:08,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08 WrapperNode [2025-02-05 18:37:08,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:37:08,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:37:08,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:37:08,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:37:08,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,472 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2327 [2025-02-05 18:37:08,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:37:08,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:37:08,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:37:08,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:37:08,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,538 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-05 18:37:08,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:37:08,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:37:08,666 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:37:08,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:37:08,667 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (1/1) ... [2025-02-05 18:37:08,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:37:08,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:37:08,696 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-05 18:37:08,703 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-05 18:37:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:37:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:37:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 18:37:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:37:08,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:37:09,055 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:37:09,056 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:37:10,778 INFO L? ?]: Removed 1306 outVars from TransFormulas that were not future-live. [2025-02-05 18:37:10,778 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:37:10,845 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:37:10,848 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:37:10,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:37:10 BoogieIcfgContainer [2025-02-05 18:37:10,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:37:10,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:37:10,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:37:10,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:37:10,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:37:07" (1/3) ... [2025-02-05 18:37:10,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2b50d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:37:10, skipping insertion in model container [2025-02-05 18:37:10,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:08" (2/3) ... [2025-02-05 18:37:10,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2b50d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:37:10, skipping insertion in model container [2025-02-05 18:37:10,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:37:10" (3/3) ... [2025-02-05 18:37:10,855 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal2.c [2025-02-05 18:37:10,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:37:10,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal2.c that has 1 procedures, 510 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:37:10,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:37:10,930 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;@2390dc23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:37:10,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:37:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 510 states, 508 states have (on average 1.5098425196850394) internal successors, (767), 509 states have internal predecessors, (767), 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-05 18:37:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 18:37:10,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:10,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:37:10,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:10,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1583465818, now seen corresponding path program 1 times [2025-02-05 18:37:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:10,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151007342] [2025-02-05 18:37:10,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:11,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 18:37:11,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 18:37:11,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:11,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:11,613 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-05 18:37:11,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151007342] [2025-02-05 18:37:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151007342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:11,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:11,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:37:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885309998] [2025-02-05 18:37:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:11,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:37:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:11,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:37:11,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:11,638 INFO L87 Difference]: Start difference. First operand has 510 states, 508 states have (on average 1.5098425196850394) internal successors, (767), 509 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:11,904 INFO L93 Difference]: Finished difference Result 897 states and 1353 transitions. [2025-02-05 18:37:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:37:11,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 18:37:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:11,913 INFO L225 Difference]: With dead ends: 897 [2025-02-05 18:37:11,913 INFO L226 Difference]: Without dead ends: 509 [2025-02-05 18:37:11,915 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-05 18:37:11,917 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 0 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:11,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1912 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:37:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-05 18:37:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-02-05 18:37:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.5059055118110236) internal successors, (765), 508 states have internal predecessors, (765), 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-05 18:37:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 765 transitions. [2025-02-05 18:37:11,968 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 765 transitions. Word has length 79 [2025-02-05 18:37:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:11,968 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 765 transitions. [2025-02-05 18:37:11,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 765 transitions. [2025-02-05 18:37:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 18:37:11,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:11,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:37:11,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:37:11,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:11,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1847479866, now seen corresponding path program 1 times [2025-02-05 18:37:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142829235] [2025-02-05 18:37:11,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:12,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 18:37:12,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 18:37:12,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:12,232 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-05 18:37:12,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:12,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142829235] [2025-02-05 18:37:12,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142829235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:12,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:12,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:37:12,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343150258] [2025-02-05 18:37:12,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:12,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:37:12,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:12,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:37:12,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:12,234 INFO L87 Difference]: Start difference. First operand 509 states and 765 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:12,522 INFO L93 Difference]: Finished difference Result 898 states and 1351 transitions. [2025-02-05 18:37:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:37:12,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 18:37:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:12,524 INFO L225 Difference]: With dead ends: 898 [2025-02-05 18:37:12,524 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 18:37:12,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:12,526 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 0 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:12,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1909 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:37:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 18:37:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-02-05 18:37:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.503921568627451) internal successors, (767), 510 states have internal predecessors, (767), 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-05 18:37:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 767 transitions. [2025-02-05 18:37:12,545 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 767 transitions. Word has length 80 [2025-02-05 18:37:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:12,545 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 767 transitions. [2025-02-05 18:37:12,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 767 transitions. [2025-02-05 18:37:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 18:37:12,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:12,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:37:12,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:37:12,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:12,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:12,552 INFO L85 PathProgramCache]: Analyzing trace with hash -926156459, now seen corresponding path program 1 times [2025-02-05 18:37:12,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:12,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591238027] [2025-02-05 18:37:12,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:12,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:12,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 18:37:12,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 18:37:12,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:12,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:13,095 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-05 18:37:13,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591238027] [2025-02-05 18:37:13,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591238027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:13,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:13,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:37:13,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527780545] [2025-02-05 18:37:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:13,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:37:13,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:13,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:37:13,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:37:13,097 INFO L87 Difference]: Start difference. First operand 511 states and 767 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:13,488 INFO L93 Difference]: Finished difference Result 937 states and 1403 transitions. [2025-02-05 18:37:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:37:13,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 18:37:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:13,491 INFO L225 Difference]: With dead ends: 937 [2025-02-05 18:37:13,494 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 18:37:13,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:37:13,495 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 799 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2513 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:13,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2513 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:37:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 18:37:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 529. [2025-02-05 18:37:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5018939393939394) internal successors, (793), 528 states have internal predecessors, (793), 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-05 18:37:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 793 transitions. [2025-02-05 18:37:13,547 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 793 transitions. Word has length 81 [2025-02-05 18:37:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:13,547 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 793 transitions. [2025-02-05 18:37:13,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 793 transitions. [2025-02-05 18:37:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 18:37:13,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:13,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:37:13,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:37:13,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:13,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1052683329, now seen corresponding path program 1 times [2025-02-05 18:37:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:13,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552930924] [2025-02-05 18:37:13,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:13,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 18:37:13,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 18:37:13,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:13,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:13,859 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-05 18:37:13,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:13,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552930924] [2025-02-05 18:37:13,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552930924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:13,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:13,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:37:13,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737067296] [2025-02-05 18:37:13,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:13,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:37:13,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:13,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:37:13,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:37:13,860 INFO L87 Difference]: Start difference. First operand 529 states and 793 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:14,354 INFO L93 Difference]: Finished difference Result 939 states and 1405 transitions. [2025-02-05 18:37:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:37:14,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 18:37:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:14,356 INFO L225 Difference]: With dead ends: 939 [2025-02-05 18:37:14,356 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 18:37:14,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:37:14,357 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 802 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 3758 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:14,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 3758 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:37:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 18:37:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 532. [2025-02-05 18:37:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.5009416195856873) internal successors, (797), 531 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 797 transitions. [2025-02-05 18:37:14,370 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 797 transitions. Word has length 82 [2025-02-05 18:37:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:14,371 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 797 transitions. [2025-02-05 18:37:14,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 797 transitions. [2025-02-05 18:37:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 18:37:14,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:14,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:37:14,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:37:14,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:14,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash 244063701, now seen corresponding path program 1 times [2025-02-05 18:37:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:14,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758610466] [2025-02-05 18:37:14,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:14,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 18:37:14,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 18:37:14,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:14,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:14,938 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-05 18:37:14,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:14,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758610466] [2025-02-05 18:37:14,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758610466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:14,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:14,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 18:37:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887495421] [2025-02-05 18:37:14,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:14,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 18:37:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:14,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 18:37:14,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:37:14,940 INFO L87 Difference]: Start difference. First operand 532 states and 797 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-05 18:37:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:15,491 INFO L93 Difference]: Finished difference Result 939 states and 1404 transitions. [2025-02-05 18:37:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:37:15,492 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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 83 [2025-02-05 18:37:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:15,495 INFO L225 Difference]: With dead ends: 939 [2025-02-05 18:37:15,495 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 18:37:15,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-05 18:37:15,497 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 797 mSDsluCounter, 3120 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:15,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 3744 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:37:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 18:37:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 536. [2025-02-05 18:37:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.4990654205607477) internal successors, (802), 535 states have internal predecessors, (802), 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-05 18:37:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 802 transitions. [2025-02-05 18:37:15,514 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 802 transitions. Word has length 83 [2025-02-05 18:37:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:15,515 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 802 transitions. [2025-02-05 18:37:15,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-05 18:37:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 802 transitions. [2025-02-05 18:37:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 18:37:15,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:15,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:37:15,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:37:15,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:15,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1410135818, now seen corresponding path program 1 times [2025-02-05 18:37:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:15,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432127535] [2025-02-05 18:37:15,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:15,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:15,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 18:37:15,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 18:37:15,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:15,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 18:37:15,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 18:37:15,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 18:37:15,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 18:37:15,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:15,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 18:37:15,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 18:37:15,647 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 18:37:15,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 18:37:15,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:37:15,652 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 18:37:15,705 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 18:37:15,727 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 18:37:15,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 06:37:15 BoogieIcfgContainer [2025-02-05 18:37:15,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 18:37:15,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 18:37:15,732 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 18:37:15,732 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 18:37:15,733 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:37:10" (3/4) ... [2025-02-05 18:37:15,734 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 18:37:15,735 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 18:37:15,735 INFO L158 Benchmark]: Toolchain (without parser) took 7998.35ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 111.5MB in the beginning and 232.9MB in the end (delta: -121.5MB). Peak memory consumption was 311.0MB. Max. memory is 16.1GB. [2025-02-05 18:37:15,736 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 18:37:15,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.75ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 67.7MB in the end (delta: 43.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 18:37:15,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 234.83ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 81.7MB in the end (delta: -14.0MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2025-02-05 18:37:15,737 INFO L158 Benchmark]: Boogie Preprocessor took 190.96ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 58.8MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 18:37:15,737 INFO L158 Benchmark]: IcfgBuilder took 2183.48ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 58.8MB in the beginning and 322.0MB in the end (delta: -263.2MB). Peak memory consumption was 226.3MB. Max. memory is 16.1GB. [2025-02-05 18:37:15,737 INFO L158 Benchmark]: TraceAbstraction took 4881.92ms. Allocated memory was 427.8MB in the beginning and 570.4MB in the end (delta: 142.6MB). Free memory was 318.5MB in the beginning and 233.0MB in the end (delta: 85.5MB). Peak memory consumption was 223.3MB. Max. memory is 16.1GB. [2025-02-05 18:37:15,738 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 570.4MB. Free memory was 233.0MB in the beginning and 232.9MB in the end (delta: 23.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 18:37:15,739 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.22ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.75ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 67.7MB in the end (delta: 43.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 234.83ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 81.7MB in the end (delta: -14.0MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 190.96ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 58.8MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 2183.48ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 58.8MB in the beginning and 322.0MB in the end (delta: -263.2MB). Peak memory consumption was 226.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4881.92ms. Allocated memory was 427.8MB in the beginning and 570.4MB in the end (delta: 142.6MB). Free memory was 318.5MB in the beginning and 233.0MB in the end (delta: 85.5MB). Peak memory consumption was 223.3MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 570.4MB. Free memory was 233.0MB in the beginning and 232.9MB in the end (delta: 23.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 bitwiseOr at line 270, overapproximation of bitwiseAnd at line 275. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_121 mask_SORT_121 = (SORT_121)-1 >> (sizeof(SORT_121) * 8 - 2); [L39] const SORT_121 msb_SORT_121 = (SORT_121)1 << (2 - 1); [L41] const SORT_1 var_56 = 0; [L42] const SORT_6 var_60 = 0; [L43] const SORT_1 var_73 = 1; [L44] const SORT_14 var_77 = 0; [L45] const SORT_10 var_107 = 0; [L46] const SORT_10 var_116 = 2; [L47] const SORT_10 var_119 = 4; [L48] const SORT_10 var_126 = 1; [L49] const SORT_121 var_133 = 1; [L50] const SORT_121 var_136 = 3; [L51] const SORT_121 var_139 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L55] SORT_1 input_4; [L56] SORT_1 input_5; [L57] SORT_6 input_7; [L58] SORT_6 input_8; [L59] SORT_1 input_9; [L60] SORT_10 input_11; [L61] SORT_1 input_12; [L62] SORT_1 input_13; [L63] SORT_14 input_15; [L64] SORT_10 input_16; [L65] SORT_1 input_17; [L66] SORT_6 input_18; [L67] SORT_1 input_19; [L68] SORT_10 input_20; [L69] SORT_10 input_21; [L70] SORT_6 input_22; [L71] SORT_6 input_23; [L72] SORT_1 input_24; [L73] SORT_14 input_25; [L74] SORT_10 input_26; [L75] SORT_1 input_27; [L76] SORT_6 input_28; [L77] SORT_6 input_29; [L78] SORT_6 input_30; [L79] SORT_6 input_31; [L80] SORT_10 input_32; [L81] SORT_10 input_33; [L82] SORT_10 input_34; [L83] SORT_10 input_35; [L84] SORT_10 input_36; [L85] SORT_10 input_37; [L86] SORT_10 input_38; [L87] SORT_10 input_39; [L88] SORT_1 input_40; [L89] SORT_1 input_41; [L90] SORT_1 input_42; [L91] SORT_1 input_43; [L92] SORT_1 input_44; [L93] SORT_1 input_45; [L94] SORT_14 input_46; [L95] SORT_14 input_47; [L96] SORT_14 input_48; [L97] SORT_14 input_49; [L98] SORT_6 input_50; [L99] SORT_6 input_51; [L100] SORT_1 input_52; [L101] SORT_1 input_53; [L102] SORT_1 input_54; [L103] SORT_1 input_55; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L105] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L106] SORT_6 state_61 = __VERIFIER_nondet_uint() & mask_SORT_6; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L107] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L108] SORT_6 state_66 = __VERIFIER_nondet_uint() & mask_SORT_6; [L109] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L109] SORT_14 state_78 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L110] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L110] SORT_14 state_81 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L111] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L112] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L113] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L113] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L114] SORT_10 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L115] SORT_10 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L116] SORT_1 state_145 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L117] SORT_1 state_148 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L118] SORT_10 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L119] SORT_10 state_156 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L120] SORT_1 state_171 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L121] SORT_1 state_174 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L122] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L122] SORT_14 state_213 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L123] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L123] SORT_14 state_216 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L124] SORT_1 state_219 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L125] SORT_10 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L126] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L126] SORT_1 state_227 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L127] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L127] SORT_6 state_234 = __VERIFIER_nondet_uint() & mask_SORT_6; [L128] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L128] SORT_1 state_237 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L129] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L129] SORT_10 state_242 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L130] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L130] SORT_6 state_263 = __VERIFIER_nondet_uint() & mask_SORT_6; [L131] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L131] SORT_10 state_274 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L132] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L132] SORT_1 state_302 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L133] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L133] SORT_10 state_307 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L134] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L134] SORT_1 state_323 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L136] SORT_1 init_58_arg_1 = var_56; [L137] state_57 = init_58_arg_1 [L138] SORT_6 init_62_arg_1 = var_60; [L139] state_61 = init_62_arg_1 [L140] SORT_1 init_64_arg_1 = var_56; [L141] state_63 = init_64_arg_1 [L142] SORT_6 init_67_arg_1 = var_60; [L143] state_66 = init_67_arg_1 [L144] SORT_14 init_79_arg_1 = var_77; [L145] state_78 = init_79_arg_1 [L146] SORT_14 init_82_arg_1 = var_77; [L147] state_81 = init_82_arg_1 [L148] SORT_1 init_85_arg_1 = var_56; [L149] state_84 = init_85_arg_1 [L150] SORT_6 init_91_arg_1 = var_60; [L151] state_90 = init_91_arg_1 [L152] SORT_6 init_97_arg_1 = var_60; [L153] state_96 = init_97_arg_1 [L154] SORT_10 init_109_arg_1 = var_107; [L155] state_108 = init_109_arg_1 [L156] SORT_10 init_112_arg_1 = var_107; [L157] state_111 = init_112_arg_1 [L158] SORT_1 init_146_arg_1 = var_56; [L159] state_145 = init_146_arg_1 [L160] SORT_1 init_149_arg_1 = var_56; [L161] state_148 = init_149_arg_1 [L162] SORT_10 init_154_arg_1 = var_107; [L163] state_153 = init_154_arg_1 [L164] SORT_10 init_157_arg_1 = var_107; [L165] state_156 = init_157_arg_1 [L166] SORT_1 init_172_arg_1 = var_56; [L167] state_171 = init_172_arg_1 [L168] SORT_1 init_175_arg_1 = var_56; [L169] state_174 = init_175_arg_1 [L170] SORT_14 init_214_arg_1 = var_77; [L171] state_213 = init_214_arg_1 [L172] SORT_14 init_217_arg_1 = var_77; [L173] state_216 = init_217_arg_1 [L174] SORT_1 init_220_arg_1 = var_56; [L175] state_219 = init_220_arg_1 [L176] SORT_10 init_223_arg_1 = var_107; [L177] state_222 = init_223_arg_1 [L178] SORT_1 init_228_arg_1 = var_56; [L179] state_227 = init_228_arg_1 [L180] SORT_6 init_235_arg_1 = var_60; [L181] state_234 = init_235_arg_1 [L182] SORT_1 init_238_arg_1 = var_56; [L183] state_237 = init_238_arg_1 [L184] SORT_10 init_243_arg_1 = var_107; [L185] state_242 = init_243_arg_1 [L186] SORT_6 init_264_arg_1 = var_60; [L187] state_263 = init_264_arg_1 [L188] SORT_10 init_275_arg_1 = var_107; [L189] state_274 = init_275_arg_1 [L190] SORT_1 init_303_arg_1 = var_56; [L191] state_302 = init_303_arg_1 [L192] SORT_10 init_308_arg_1 = var_107; [L193] state_307 = init_308_arg_1 [L194] SORT_1 init_324_arg_1 = var_56; [L195] state_323 = init_324_arg_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L198] input_2 = __VERIFIER_nondet_uchar() [L199] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L199] input_2 = input_2 & mask_SORT_1 [L200] input_3 = __VERIFIER_nondet_uchar() [L201] input_4 = __VERIFIER_nondet_uchar() [L202] input_5 = __VERIFIER_nondet_uchar() [L203] input_7 = __VERIFIER_nondet_uint() [L204] input_8 = __VERIFIER_nondet_uint() [L205] input_9 = __VERIFIER_nondet_uchar() [L206] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L206] input_9 = input_9 & mask_SORT_1 [L207] input_11 = __VERIFIER_nondet_uchar() [L208] input_12 = __VERIFIER_nondet_uchar() [L209] input_13 = __VERIFIER_nondet_uchar() [L210] input_15 = __VERIFIER_nondet_ulong() [L211] input_16 = __VERIFIER_nondet_uchar() [L212] input_17 = __VERIFIER_nondet_uchar() [L213] input_18 = __VERIFIER_nondet_uint() [L214] input_19 = __VERIFIER_nondet_uchar() [L215] input_20 = __VERIFIER_nondet_uchar() [L216] input_21 = __VERIFIER_nondet_uchar() [L217] input_22 = __VERIFIER_nondet_uint() [L218] input_23 = __VERIFIER_nondet_uint() [L219] input_24 = __VERIFIER_nondet_uchar() [L220] input_25 = __VERIFIER_nondet_ulong() [L221] input_26 = __VERIFIER_nondet_uchar() [L222] input_27 = __VERIFIER_nondet_uchar() [L223] input_28 = __VERIFIER_nondet_uint() [L224] input_29 = __VERIFIER_nondet_uint() [L225] input_30 = __VERIFIER_nondet_uint() [L226] input_31 = __VERIFIER_nondet_uint() [L227] input_32 = __VERIFIER_nondet_uchar() [L228] input_33 = __VERIFIER_nondet_uchar() [L229] input_34 = __VERIFIER_nondet_uchar() [L230] input_35 = __VERIFIER_nondet_uchar() [L231] input_36 = __VERIFIER_nondet_uchar() [L232] input_37 = __VERIFIER_nondet_uchar() [L233] input_38 = __VERIFIER_nondet_uchar() [L234] input_39 = __VERIFIER_nondet_uchar() [L235] input_40 = __VERIFIER_nondet_uchar() [L236] input_41 = __VERIFIER_nondet_uchar() [L237] input_42 = __VERIFIER_nondet_uchar() [L238] input_43 = __VERIFIER_nondet_uchar() [L239] input_44 = __VERIFIER_nondet_uchar() [L240] input_45 = __VERIFIER_nondet_uchar() [L241] input_46 = __VERIFIER_nondet_ulong() [L242] input_47 = __VERIFIER_nondet_ulong() [L243] input_48 = __VERIFIER_nondet_ulong() [L244] input_49 = __VERIFIER_nondet_ulong() [L245] input_50 = __VERIFIER_nondet_uint() [L246] input_51 = __VERIFIER_nondet_uint() [L247] input_52 = __VERIFIER_nondet_uchar() [L248] input_53 = __VERIFIER_nondet_uchar() [L249] input_54 = __VERIFIER_nondet_uchar() [L250] input_55 = __VERIFIER_nondet_uchar() [L253] SORT_1 var_59_arg_0 = state_57; [L254] SORT_1 var_59 = ~var_59_arg_0; [L255] SORT_1 var_65_arg_0 = state_63; [L256] SORT_6 var_65_arg_1 = state_61; [L257] SORT_6 var_65_arg_2 = input_18; [L258] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; VAL [input_18=0, input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0] [L259] EXPR var_65 & mask_SORT_6 VAL [input_18=0, input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_73=1, var_77=0] [L259] var_65 = var_65 & mask_SORT_6 [L260] SORT_1 var_68_arg_0 = state_63; [L261] SORT_6 var_68_arg_1 = state_66; [L262] SORT_6 var_68_arg_2 = input_18; [L263] SORT_6 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_68=0, var_73=1, var_77=0] [L264] EXPR var_68 & mask_SORT_6 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0] [L264] var_68 = var_68 & mask_SORT_6 [L265] SORT_6 var_69_arg_0 = var_65; [L266] SORT_6 var_69_arg_1 = var_68; [L267] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L268] SORT_1 var_70_arg_0 = var_59; [L269] SORT_1 var_70_arg_1 = var_69; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_70_arg_0=-1, var_70_arg_1=1, var_73=1, var_77=0] [L270] EXPR var_70_arg_0 | var_70_arg_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L270] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L271] SORT_1 var_74_arg_0 = var_70; [L272] SORT_1 var_74 = ~var_74_arg_0; [L273] SORT_1 var_75_arg_0 = var_73; [L274] SORT_1 var_75_arg_1 = var_74; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_75_arg_0=1, var_75_arg_1=-1, var_77=0] [L275] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L275] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L276] EXPR var_75 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L276] var_75 = var_75 & mask_SORT_1 [L277] SORT_1 bad_76_arg_0 = var_75; [L278] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 510 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2398 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2398 mSDsluCounter, 13836 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10679 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2949 IncrementalHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3157 mSDtfsCounter, 2949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=536occurred in iteration=5, InterpolantAutomatonStates: 31, 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, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 1261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-05 18:37:15,764 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.cal2.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 e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:37:18,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:37:18,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 18:37:18,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:37:18,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:37:18,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:37:18,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:37:18,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:37:18,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:37:18,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:37:18,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:37:18,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:37:18,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:37:18,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:37:18,124 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:37:18,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:37:18,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:37:18,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:37:18,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:37:18,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:37:18,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:37:18,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:37:18,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:37:18,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:37:18,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:37:18,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:37:18,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:37:18,127 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 18:37:18,127 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 18:37:18,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:37:18,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:37:18,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:37:18,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:37:18,128 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 -> e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec [2025-02-05 18:37:18,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:37:18,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:37:18,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:37:18,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:37:18,436 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:37:18,436 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.cal2.c [2025-02-05 18:37:19,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2fa6d344/9688e4ded442462f98ee5d8696c057ac/FLAGc3179bc3f [2025-02-05 18:37:19,883 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:37:19,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2025-02-05 18:37:19,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2fa6d344/9688e4ded442462f98ee5d8696c057ac/FLAGc3179bc3f [2025-02-05 18:37:20,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2fa6d344/9688e4ded442462f98ee5d8696c057ac [2025-02-05 18:37:20,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:37:20,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:37:20,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:37:20,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:37:20,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:37:20,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b95af25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20, skipping insertion in model container [2025-02-05 18:37:20,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:37:20,367 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.cal2.c[1244,1257] [2025-02-05 18:37:20,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:37:20,539 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:37:20,549 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.cal2.c[1244,1257] [2025-02-05 18:37:20,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:37:20,656 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:37:20,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20 WrapperNode [2025-02-05 18:37:20,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:37:20,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:37:20,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:37:20,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:37:20,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,751 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1327 [2025-02-05 18:37:20,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:37:20,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:37:20,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:37:20,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:37:20,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,796 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-05 18:37:20,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:37:20,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:37:20,849 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:37:20,849 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:37:20,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (1/1) ... [2025-02-05 18:37:20,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:37:20,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:37:20,871 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-05 18:37:20,875 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-05 18:37:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:37:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 18:37:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 18:37:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:37:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:37:21,098 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:37:21,099 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:37:21,888 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-02-05 18:37:21,888 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:37:21,895 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:37:21,895 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:37:21,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:37:21 BoogieIcfgContainer [2025-02-05 18:37:21,896 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:37:21,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:37:21,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:37:21,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:37:21,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:37:20" (1/3) ... [2025-02-05 18:37:21,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f91d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:37:21, skipping insertion in model container [2025-02-05 18:37:21,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:20" (2/3) ... [2025-02-05 18:37:21,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f91d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:37:21, skipping insertion in model container [2025-02-05 18:37:21,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:37:21" (3/3) ... [2025-02-05 18:37:21,902 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal2.c [2025-02-05 18:37:21,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:37:21,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:37:21,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:37:21,953 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;@59e9aa01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:37:21,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:37:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 18:37:21,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:21,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 18:37:21,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:21,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 18:37:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:37:21,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387220704] [2025-02-05 18:37:21,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:21,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:37:21,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:37:21,978 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-05 18:37:21,980 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-05 18:37:22,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 18:37:22,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 18:37:22,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:22,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:22,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 18:37:22,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:37:22,343 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-05 18:37:22,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:37:22,343 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 18:37:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387220704] [2025-02-05 18:37:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387220704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:22,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:22,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:37:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851784681] [2025-02-05 18:37:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:22,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:37:22,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 18:37:22,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:37:22,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:22,363 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:22,535 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 18:37:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:37:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 18:37:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:22,543 INFO L225 Difference]: With dead ends: 18 [2025-02-05 18:37:22,543 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 18:37:22,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:37:22,548 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:22,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:37:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 18:37:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 18:37:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 18:37:22,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 18:37:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:22,570 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 18:37:22,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 18:37:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 18:37:22,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:22,570 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 18:37:22,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 18:37:22,775 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-05 18:37:22,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:22,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 18:37:22,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:37:22,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418894941] [2025-02-05 18:37:22,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:22,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:37:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:37:22,779 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-05 18:37:22,780 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-05 18:37:23,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 18:37:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 18:37:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:23,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 18:37:23,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:37:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:23,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:37:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:24,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 18:37:24,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418894941] [2025-02-05 18:37:24,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418894941] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:37:24,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 18:37:24,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 18:37:24,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105657903] [2025-02-05 18:37:24,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 18:37:24,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 18:37:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 18:37:24,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 18:37:24,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:37:24,210 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-05 18:37:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:24,504 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-05 18:37:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:37:24,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2025-02-05 18:37:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:24,505 INFO L225 Difference]: With dead ends: 15 [2025-02-05 18:37:24,505 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 18:37:24,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:37:24,505 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:24,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:37:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 18:37:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-05 18:37:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-05 18:37:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-05 18:37:24,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-02-05 18:37:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:24,508 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-05 18:37:24,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-05 18:37:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-05 18:37:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 18:37:24,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:24,509 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-05 18:37:24,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 18:37:24,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:37:24,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:24,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-02-05 18:37:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:37:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315001692] [2025-02-05 18:37:24,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 18:37:24,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:37:24,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:37:24,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 18:37:24,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 18:37:25,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-05 18:37:26,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 18:37:26,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 18:37:26,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:26,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-05 18:37:26,459 INFO L279 TraceCheckSpWp]: Computing forward predicates...