./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.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.cal1.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 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:24:09,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:24:09,195 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:24:09,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:24:09,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:24:09,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:24:09,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:24:09,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:24:09,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:24:09,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:24:09,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:24:09,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:24:09,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:24:09,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:24:09,213 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:24:09,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:24:09,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:24:09,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:24:09,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:24:09,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:24:09,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:24:09,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:24:09,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:24:09,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:24:09,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:24:09,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:24:09,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:24:09,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:24:09,215 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 -> 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a [2025-02-05 18:24:09,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:24:09,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:24:09,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:24:09,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:24:09,491 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:24:09,492 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.cal1.c [2025-02-05 18:24:10,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/804562718/302bb5d0bc224d959af2e01db6546f27/FLAGbbe1f53bb [2025-02-05 18:24:11,064 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:24:11,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2025-02-05 18:24:11,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/804562718/302bb5d0bc224d959af2e01db6546f27/FLAGbbe1f53bb [2025-02-05 18:24:11,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/804562718/302bb5d0bc224d959af2e01db6546f27 [2025-02-05 18:24:11,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:24:11,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:24:11,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:24:11,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:24:11,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:24:11,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126c0674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11, skipping insertion in model container [2025-02-05 18:24:11,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:24:11,307 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.cal1.c[1244,1257] [2025-02-05 18:24:11,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:24:11,487 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:24:11,496 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.cal1.c[1244,1257] [2025-02-05 18:24:11,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:24:11,610 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:24:11,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11 WrapperNode [2025-02-05 18:24:11,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:24:11,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:24:11,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:24:11,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:24:11,615 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:24:11" (1/1) ... [2025-02-05 18:24:11,632 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:24:11" (1/1) ... [2025-02-05 18:24:11,724 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1797 [2025-02-05 18:24:11,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:24:11,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:24:11,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:24:11,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:24:11,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,788 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:24:11,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:24:11,890 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:24:11,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:24:11,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:24:11,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (1/1) ... [2025-02-05 18:24:11,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:24:11,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:24:11,922 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:24:11,965 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:24:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:24:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:24:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 18:24:11,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:24:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:24:12,162 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:24:12,163 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:24:13,341 INFO L? ?]: Removed 1027 outVars from TransFormulas that were not future-live. [2025-02-05 18:24:13,342 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:24:13,390 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:24:13,390 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:24:13,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:24:13 BoogieIcfgContainer [2025-02-05 18:24:13,391 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:24:13,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:24:13,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:24:13,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:24:13,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:24:11" (1/3) ... [2025-02-05 18:24:13,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590b2155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:24:13, skipping insertion in model container [2025-02-05 18:24:13,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:11" (2/3) ... [2025-02-05 18:24:13,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590b2155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:24:13, skipping insertion in model container [2025-02-05 18:24:13,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:24:13" (3/3) ... [2025-02-05 18:24:13,398 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal1.c [2025-02-05 18:24:13,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:24:13,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal1.c that has 1 procedures, 330 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:24:13,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:24:13,458 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;@7aacc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:24:13,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:24:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 328 states have (on average 1.4969512195121952) internal successors, (491), 329 states have internal predecessors, (491), 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:24:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 18:24:13,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:13,467 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:24:13,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1625774684, now seen corresponding path program 1 times [2025-02-05 18:24:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:13,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211446385] [2025-02-05 18:24:13,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:13,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 18:24:13,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 18:24:13,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:13,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:14,194 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:24:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:14,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211446385] [2025-02-05 18:24:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211446385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:14,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:14,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:24:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019108513] [2025-02-05 18:24:14,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:14,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:24:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:14,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:24:14,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:24:14,223 INFO L87 Difference]: Start difference. First operand has 330 states, 328 states have (on average 1.4969512195121952) internal successors, (491), 329 states have internal predecessors, (491), 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:24:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:14,459 INFO L93 Difference]: Finished difference Result 537 states and 801 transitions. [2025-02-05 18:24:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:24:14,460 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:24:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:14,467 INFO L225 Difference]: With dead ends: 537 [2025-02-05 18:24:14,467 INFO L226 Difference]: Without dead ends: 329 [2025-02-05 18:24:14,470 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:24:14,472 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:14,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1210 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:24:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-05 18:24:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-02-05 18:24:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4908536585365855) internal successors, (489), 328 states have internal predecessors, (489), 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:24:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 489 transitions. [2025-02-05 18:24:14,518 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 489 transitions. Word has length 79 [2025-02-05 18:24:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:14,519 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 489 transitions. [2025-02-05 18:24:14,519 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:24:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 489 transitions. [2025-02-05 18:24:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 18:24:14,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:14,522 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:24:14,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:24:14,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:14,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1135912902, now seen corresponding path program 1 times [2025-02-05 18:24:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530214728] [2025-02-05 18:24:14,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:14,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 18:24:14,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 18:24:14,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:14,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:14,761 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:24:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:14,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530214728] [2025-02-05 18:24:14,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530214728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:14,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:14,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:24:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802911553] [2025-02-05 18:24:14,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:14,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:24:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:14,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:24:14,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:24:14,763 INFO L87 Difference]: Start difference. First operand 329 states and 489 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:24:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:14,941 INFO L93 Difference]: Finished difference Result 538 states and 799 transitions. [2025-02-05 18:24:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:24:14,941 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:24:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:14,943 INFO L225 Difference]: With dead ends: 538 [2025-02-05 18:24:14,944 INFO L226 Difference]: Without dead ends: 331 [2025-02-05 18:24:14,944 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:24:14,945 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:14,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1207 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:24:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-02-05 18:24:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2025-02-05 18:24:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.4878787878787878) internal successors, (491), 330 states have internal predecessors, (491), 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:24:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 491 transitions. [2025-02-05 18:24:14,962 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 491 transitions. Word has length 80 [2025-02-05 18:24:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:14,962 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 491 transitions. [2025-02-05 18:24:14,962 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:24:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2025-02-05 18:24:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 18:24:14,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:14,968 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:24:14,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:24:14,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1077947927, now seen corresponding path program 1 times [2025-02-05 18:24:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61717860] [2025-02-05 18:24:14,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:15,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 18:24:15,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 18:24:15,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:15,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:15,360 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:24:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61717860] [2025-02-05 18:24:15,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61717860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:15,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:15,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:24:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152613275] [2025-02-05 18:24:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:15,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:24:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:15,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:24:15,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:24:15,362 INFO L87 Difference]: Start difference. First operand 331 states and 491 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:24:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:15,706 INFO L93 Difference]: Finished difference Result 577 states and 851 transitions. [2025-02-05 18:24:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:24:15,707 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:24:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:15,708 INFO L225 Difference]: With dead ends: 577 [2025-02-05 18:24:15,708 INFO L226 Difference]: Without dead ends: 368 [2025-02-05 18:24:15,709 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:24:15,709 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 523 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:15,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1573 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:24:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-05 18:24:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 349. [2025-02-05 18:24:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.485632183908046) internal successors, (517), 348 states have internal predecessors, (517), 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:24:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 517 transitions. [2025-02-05 18:24:15,730 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 517 transitions. Word has length 81 [2025-02-05 18:24:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:15,731 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 517 transitions. [2025-02-05 18:24:15,731 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:24:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 517 transitions. [2025-02-05 18:24:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 18:24:15,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:15,732 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:24:15,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:24:15,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:15,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 945010175, now seen corresponding path program 1 times [2025-02-05 18:24:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796043958] [2025-02-05 18:24:15,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:15,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 18:24:15,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 18:24:15,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:15,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:16,028 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:24:16,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:16,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796043958] [2025-02-05 18:24:16,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796043958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:16,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:16,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:24:16,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038788581] [2025-02-05 18:24:16,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:16,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:24:16,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:16,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:24:16,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:24:16,030 INFO L87 Difference]: Start difference. First operand 349 states and 517 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:24:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:16,457 INFO L93 Difference]: Finished difference Result 579 states and 853 transitions. [2025-02-05 18:24:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:24:16,458 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:24:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:16,459 INFO L225 Difference]: With dead ends: 579 [2025-02-05 18:24:16,459 INFO L226 Difference]: Without dead ends: 370 [2025-02-05 18:24:16,460 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:24:16,460 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 526 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:16,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 2348 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:24:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-05 18:24:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 352. [2025-02-05 18:24:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.4843304843304843) internal successors, (521), 351 states have internal predecessors, (521), 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:24:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 521 transitions. [2025-02-05 18:24:16,472 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 521 transitions. Word has length 82 [2025-02-05 18:24:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:16,472 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 521 transitions. [2025-02-05 18:24:16,473 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:24:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 521 transitions. [2025-02-05 18:24:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 18:24:16,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:16,474 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:24:16,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:24:16,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:16,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash -961342340, now seen corresponding path program 1 times [2025-02-05 18:24:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:16,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222708834] [2025-02-05 18:24:16,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:16,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 18:24:16,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 18:24:16,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:16,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:16,975 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:24:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:24:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222708834] [2025-02-05 18:24:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222708834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 18:24:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369715409] [2025-02-05 18:24:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:16,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 18:24:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:24:16,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 18:24:16,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:24:16,976 INFO L87 Difference]: Start difference. First operand 352 states and 521 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:24:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:17,426 INFO L93 Difference]: Finished difference Result 579 states and 852 transitions. [2025-02-05 18:24:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:24:17,426 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:24:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:17,428 INFO L225 Difference]: With dead ends: 579 [2025-02-05 18:24:17,428 INFO L226 Difference]: Without dead ends: 370 [2025-02-05 18:24:17,428 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:24:17,429 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 521 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:17,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2334 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:24:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-05 18:24:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 356. [2025-02-05 18:24:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.4816901408450704) internal successors, (526), 355 states have internal predecessors, (526), 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:24:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 526 transitions. [2025-02-05 18:24:17,435 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 526 transitions. Word has length 83 [2025-02-05 18:24:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:17,435 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 526 transitions. [2025-02-05 18:24:17,436 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:24:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 526 transitions. [2025-02-05 18:24:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 18:24:17,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:17,436 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:24:17,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:24:17,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:17,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1302493347, now seen corresponding path program 1 times [2025-02-05 18:24:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:24:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598304899] [2025-02-05 18:24:17,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:24:17,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 18:24:17,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 18:24:17,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:17,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 18:24:17,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 18:24:17,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 18:24:17,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 18:24:17,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:17,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 18:24:17,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 18:24:17,551 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 18:24:17,552 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 18:24:17,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:24:17,555 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 18:24:17,587 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 18:24:17,596 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 18:24:17,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 06:24:17 BoogieIcfgContainer [2025-02-05 18:24:17,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 18:24:17,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 18:24:17,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 18:24:17,599 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 18:24:17,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:24:13" (3/4) ... [2025-02-05 18:24:17,604 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 18:24:17,605 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 18:24:17,605 INFO L158 Benchmark]: Toolchain (without parser) took 6495.77ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 130.0MB in the beginning and 361.0MB in the end (delta: -231.0MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2025-02-05 18:24:17,605 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 18:24:17,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.46ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 92.6MB in the end (delta: 37.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 18:24:17,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.35ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 64.4MB in the end (delta: 28.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 18:24:17,606 INFO L158 Benchmark]: Boogie Preprocessor took 163.83ms. Allocated memory is still 167.8MB. Free memory was 64.4MB in the beginning and 47.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 18:24:17,606 INFO L158 Benchmark]: IcfgBuilder took 1500.81ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 47.7MB in the beginning and 275.8MB in the end (delta: -228.2MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-02-05 18:24:17,606 INFO L158 Benchmark]: TraceAbstraction took 4205.46ms. Allocated memory was 385.9MB in the beginning and 469.8MB in the end (delta: 83.9MB). Free memory was 275.8MB in the beginning and 361.0MB in the end (delta: -85.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 18:24:17,606 INFO L158 Benchmark]: Witness Printer took 5.98ms. Allocated memory is still 469.8MB. Free memory was 361.0MB in the beginning and 361.0MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 18:24:17,607 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.19ms. Allocated memory is still 226.5MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.46ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 92.6MB in the end (delta: 37.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.35ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 64.4MB in the end (delta: 28.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 163.83ms. Allocated memory is still 167.8MB. Free memory was 64.4MB in the beginning and 47.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1500.81ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 47.7MB in the beginning and 275.8MB in the end (delta: -228.2MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4205.46ms. Allocated memory was 385.9MB in the beginning and 469.8MB in the end (delta: 83.9MB). Free memory was 275.8MB in the beginning and 361.0MB in the end (delta: -85.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.98ms. Allocated memory is still 469.8MB. Free memory was 361.0MB in the beginning and 361.0MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 261, overapproximation of bitwiseAnd at line 266. 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_1 var_56 = 0; [L39] const SORT_6 var_60 = 0; [L40] const SORT_1 var_73 = 1; [L41] const SORT_14 var_77 = 0; [L42] const SORT_10 var_98 = 0; [L44] SORT_1 input_2; [L45] SORT_1 input_3; [L46] SORT_1 input_4; [L47] SORT_1 input_5; [L48] SORT_6 input_7; [L49] SORT_6 input_8; [L50] SORT_1 input_9; [L51] SORT_10 input_11; [L52] SORT_1 input_12; [L53] SORT_1 input_13; [L54] SORT_14 input_15; [L55] SORT_10 input_16; [L56] SORT_1 input_17; [L57] SORT_6 input_18; [L58] SORT_1 input_19; [L59] SORT_10 input_20; [L60] SORT_10 input_21; [L61] SORT_6 input_22; [L62] SORT_6 input_23; [L63] SORT_1 input_24; [L64] SORT_14 input_25; [L65] SORT_10 input_26; [L66] SORT_1 input_27; [L67] SORT_6 input_28; [L68] SORT_6 input_29; [L69] SORT_6 input_30; [L70] SORT_6 input_31; [L71] SORT_10 input_32; [L72] SORT_10 input_33; [L73] SORT_10 input_34; [L74] SORT_10 input_35; [L75] SORT_10 input_36; [L76] SORT_10 input_37; [L77] SORT_10 input_38; [L78] SORT_10 input_39; [L79] SORT_1 input_40; [L80] SORT_1 input_41; [L81] SORT_1 input_42; [L82] SORT_1 input_43; [L83] SORT_1 input_44; [L84] SORT_1 input_45; [L85] SORT_14 input_46; [L86] SORT_14 input_47; [L87] SORT_14 input_48; [L88] SORT_14 input_49; [L89] SORT_6 input_50; [L90] SORT_6 input_51; [L91] SORT_1 input_52; [L92] SORT_1 input_53; [L93] SORT_1 input_54; [L94] SORT_1 input_55; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L96] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L97] SORT_6 state_61 = __VERIFIER_nondet_uint() & mask_SORT_6; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L98] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L99] SORT_6 state_66 = __VERIFIER_nondet_uint() & mask_SORT_6; [L100] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L100] SORT_14 state_78 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L101] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L101] SORT_14 state_81 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L102] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L103] SORT_1 state_90 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L104] SORT_1 state_93 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L105] SORT_10 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L106] SORT_10 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L107] SORT_1 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L108] SORT_1 state_123 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L109] SORT_10 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L110] SORT_10 state_138 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L111] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L111] SORT_6 state_148 = __VERIFIER_nondet_uint() & mask_SORT_6; [L112] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L112] SORT_6 state_156 = __VERIFIER_nondet_uint() & mask_SORT_6; [L113] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L113] SORT_14 state_170 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L114] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L114] SORT_14 state_173 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L115] SORT_1 state_176 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L116] SORT_10 state_179 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L117] SORT_1 state_184 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L118] SORT_1 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L119] SORT_10 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L120] SORT_1 state_212 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L121] SORT_10 state_217 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L122] SORT_1 state_223 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L123] SORT_10 state_238 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L124] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L124] SORT_6 state_249 = __VERIFIER_nondet_uint() & mask_SORT_6; [L125] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L125] SORT_6 state_282 = __VERIFIER_nondet_uint() & mask_SORT_6; [L127] SORT_1 init_58_arg_1 = var_56; [L128] state_57 = init_58_arg_1 [L129] SORT_6 init_62_arg_1 = var_60; [L130] state_61 = init_62_arg_1 [L131] SORT_1 init_64_arg_1 = var_56; [L132] state_63 = init_64_arg_1 [L133] SORT_6 init_67_arg_1 = var_60; [L134] state_66 = init_67_arg_1 [L135] SORT_14 init_79_arg_1 = var_77; [L136] state_78 = init_79_arg_1 [L137] SORT_14 init_82_arg_1 = var_77; [L138] state_81 = init_82_arg_1 [L139] SORT_1 init_85_arg_1 = var_56; [L140] state_84 = init_85_arg_1 [L141] SORT_1 init_91_arg_1 = var_56; [L142] state_90 = init_91_arg_1 [L143] SORT_1 init_94_arg_1 = var_56; [L144] state_93 = init_94_arg_1 [L145] SORT_10 init_100_arg_1 = var_98; [L146] state_99 = init_100_arg_1 [L147] SORT_10 init_103_arg_1 = var_98; [L148] state_102 = init_103_arg_1 [L149] SORT_1 init_117_arg_1 = var_56; [L150] state_116 = init_117_arg_1 [L151] SORT_1 init_124_arg_1 = var_56; [L152] state_123 = init_124_arg_1 [L153] SORT_10 init_136_arg_1 = var_98; [L154] state_135 = init_136_arg_1 [L155] SORT_10 init_139_arg_1 = var_98; [L156] state_138 = init_139_arg_1 [L157] SORT_6 init_149_arg_1 = var_60; [L158] state_148 = init_149_arg_1 [L159] SORT_6 init_157_arg_1 = var_60; [L160] state_156 = init_157_arg_1 [L161] SORT_14 init_171_arg_1 = var_77; [L162] state_170 = init_171_arg_1 [L163] SORT_14 init_174_arg_1 = var_77; [L164] state_173 = init_174_arg_1 [L165] SORT_1 init_177_arg_1 = var_56; [L166] state_176 = init_177_arg_1 [L167] SORT_10 init_180_arg_1 = var_98; [L168] state_179 = init_180_arg_1 [L169] SORT_1 init_185_arg_1 = var_56; [L170] state_184 = init_185_arg_1 [L171] SORT_1 init_192_arg_1 = var_56; [L172] state_191 = init_192_arg_1 [L173] SORT_10 init_197_arg_1 = var_98; [L174] state_196 = init_197_arg_1 [L175] SORT_1 init_213_arg_1 = var_56; [L176] state_212 = init_213_arg_1 [L177] SORT_10 init_218_arg_1 = var_98; [L178] state_217 = init_218_arg_1 [L179] SORT_1 init_224_arg_1 = var_56; [L180] state_223 = init_224_arg_1 [L181] SORT_10 init_239_arg_1 = var_98; [L182] state_238 = init_239_arg_1 [L183] SORT_6 init_250_arg_1 = var_60; [L184] state_249 = init_250_arg_1 [L185] SORT_6 init_283_arg_1 = var_60; [L186] state_282 = init_283_arg_1 VAL [mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=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_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L189] input_2 = __VERIFIER_nondet_uchar() [L190] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=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_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L190] input_2 = input_2 & mask_SORT_1 [L191] input_3 = __VERIFIER_nondet_uchar() [L192] input_4 = __VERIFIER_nondet_uchar() [L193] input_5 = __VERIFIER_nondet_uchar() [L194] input_7 = __VERIFIER_nondet_uint() [L195] input_8 = __VERIFIER_nondet_uint() [L196] input_9 = __VERIFIER_nondet_uchar() [L197] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=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_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L197] input_9 = input_9 & mask_SORT_1 [L198] input_11 = __VERIFIER_nondet_uchar() [L199] input_12 = __VERIFIER_nondet_uchar() [L200] input_13 = __VERIFIER_nondet_uchar() [L201] input_15 = __VERIFIER_nondet_ulong() [L202] input_16 = __VERIFIER_nondet_uchar() [L203] input_17 = __VERIFIER_nondet_uchar() [L204] input_18 = __VERIFIER_nondet_uint() [L205] input_19 = __VERIFIER_nondet_uchar() [L206] input_20 = __VERIFIER_nondet_uchar() [L207] input_21 = __VERIFIER_nondet_uchar() [L208] input_22 = __VERIFIER_nondet_uint() [L209] input_23 = __VERIFIER_nondet_uint() [L210] input_24 = __VERIFIER_nondet_uchar() [L211] input_25 = __VERIFIER_nondet_ulong() [L212] input_26 = __VERIFIER_nondet_uchar() [L213] input_27 = __VERIFIER_nondet_uchar() [L214] input_28 = __VERIFIER_nondet_uint() [L215] input_29 = __VERIFIER_nondet_uint() [L216] input_30 = __VERIFIER_nondet_uint() [L217] input_31 = __VERIFIER_nondet_uint() [L218] input_32 = __VERIFIER_nondet_uchar() [L219] input_33 = __VERIFIER_nondet_uchar() [L220] input_34 = __VERIFIER_nondet_uchar() [L221] input_35 = __VERIFIER_nondet_uchar() [L222] input_36 = __VERIFIER_nondet_uchar() [L223] input_37 = __VERIFIER_nondet_uchar() [L224] input_38 = __VERIFIER_nondet_uchar() [L225] input_39 = __VERIFIER_nondet_uchar() [L226] input_40 = __VERIFIER_nondet_uchar() [L227] input_41 = __VERIFIER_nondet_uchar() [L228] input_42 = __VERIFIER_nondet_uchar() [L229] input_43 = __VERIFIER_nondet_uchar() [L230] input_44 = __VERIFIER_nondet_uchar() [L231] input_45 = __VERIFIER_nondet_uchar() [L232] input_46 = __VERIFIER_nondet_ulong() [L233] input_47 = __VERIFIER_nondet_ulong() [L234] input_48 = __VERIFIER_nondet_ulong() [L235] input_49 = __VERIFIER_nondet_ulong() [L236] input_50 = __VERIFIER_nondet_uint() [L237] input_51 = __VERIFIER_nondet_uint() [L238] input_52 = __VERIFIER_nondet_uchar() [L239] input_53 = __VERIFIER_nondet_uchar() [L240] input_54 = __VERIFIER_nondet_uchar() [L241] input_55 = __VERIFIER_nondet_uchar() [L244] SORT_1 var_59_arg_0 = state_57; [L245] SORT_1 var_59 = ~var_59_arg_0; [L246] SORT_1 var_65_arg_0 = state_63; [L247] SORT_6 var_65_arg_1 = state_61; [L248] SORT_6 var_65_arg_2 = input_18; [L249] 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_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L250] EXPR var_65 & mask_SORT_6 VAL [input_18=0, input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_73=1, var_77=0, var_98=0] [L250] var_65 = var_65 & mask_SORT_6 [L251] SORT_1 var_68_arg_0 = state_63; [L252] SORT_6 var_68_arg_1 = state_66; [L253] SORT_6 var_68_arg_2 = input_18; [L254] 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_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_68=0, var_73=1, var_77=0, var_98=0] [L255] EXPR var_68 & mask_SORT_6 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L255] var_68 = var_68 & mask_SORT_6 [L256] SORT_6 var_69_arg_0 = var_65; [L257] SORT_6 var_69_arg_1 = var_68; [L258] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L259] SORT_1 var_70_arg_0 = var_59; [L260] SORT_1 var_70_arg_1 = var_69; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, 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, var_98=0] [L261] EXPR var_70_arg_0 | var_70_arg_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L261] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L262] SORT_1 var_74_arg_0 = var_70; [L263] SORT_1 var_74 = ~var_74_arg_0; [L264] SORT_1 var_75_arg_0 = var_73; [L265] SORT_1 var_75_arg_1 = var_74; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, 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, var_98=0] [L266] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L266] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L267] EXPR var_75 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L267] var_75 = var_75 & mask_SORT_1 [L268] SORT_1 bad_76_arg_0 = var_75; [L269] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 330 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1570 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1570 mSDsluCounter, 8672 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6688 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2041 IncrementalHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1984 mSDtfsCounter, 2041 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.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred 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.8s 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:24:17,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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.cal1.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 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:24:19,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:24:19,918 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:24:19,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:24:19,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:24:19,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:24:19,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:24:19,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:24:19,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:24:19,954 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:24:19,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:24:19,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:24:19,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:24:19,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:24:19,954 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:24:19,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:24:19,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:24:19,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:24:19,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:24:19,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:24:19,956 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 -> 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a [2025-02-05 18:24:20,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:24:20,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:24:20,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:24:20,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:24:20,233 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:24:20,234 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.cal1.c [2025-02-05 18:24:21,450 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba03cbb41/4abe63da2a9b46bfbc3bea738356a2a4/FLAG2476212c9 [2025-02-05 18:24:21,688 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:24:21,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2025-02-05 18:24:21,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba03cbb41/4abe63da2a9b46bfbc3bea738356a2a4/FLAG2476212c9 [2025-02-05 18:24:21,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba03cbb41/4abe63da2a9b46bfbc3bea738356a2a4 [2025-02-05 18:24:21,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:24:21,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:24:21,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:24:21,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:24:21,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:24:21,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:24:21" (1/1) ... [2025-02-05 18:24:21,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22edce40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:21, skipping insertion in model container [2025-02-05 18:24:21,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:24:21" (1/1) ... [2025-02-05 18:24:21,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:24:21,886 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.cal1.c[1244,1257] [2025-02-05 18:24:22,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:24:22,129 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:24:22,146 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.cal1.c[1244,1257] [2025-02-05 18:24:22,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:24:22,252 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:24:22,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22 WrapperNode [2025-02-05 18:24:22,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:24:22,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:24:22,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:24:22,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:24:22,257 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:24:22" (1/1) ... [2025-02-05 18:24:22,271 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:24:22" (1/1) ... [2025-02-05 18:24:22,343 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1157 [2025-02-05 18:24:22,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:24:22,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:24:22,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:24:22,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:24:22,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,374 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:24:22,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:24:22,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:24:22,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:24:22,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:24:22,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (1/1) ... [2025-02-05 18:24:22,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:24:22,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:24:22,465 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:24:22,468 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:24:22,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:24:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 18:24:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 18:24:22,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:24:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:24:22,669 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:24:22,671 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:24:23,437 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-02-05 18:24:23,437 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:24:23,444 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:24:23,445 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:24:23,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:24:23 BoogieIcfgContainer [2025-02-05 18:24:23,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:24:23,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:24:23,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:24:23,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:24:23,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:24:21" (1/3) ... [2025-02-05 18:24:23,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421e8296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:24:23, skipping insertion in model container [2025-02-05 18:24:23,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:24:22" (2/3) ... [2025-02-05 18:24:23,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421e8296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:24:23, skipping insertion in model container [2025-02-05 18:24:23,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:24:23" (3/3) ... [2025-02-05 18:24:23,463 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal1.c [2025-02-05 18:24:23,474 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:24:23,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal1.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:24:23,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:24:23,528 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;@442b5338, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:24:23,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:24:23,532 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:24:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 18:24:23,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:23,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 18:24:23,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:23,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 18:24:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:24:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597749554] [2025-02-05 18:24:23,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:23,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:24:23,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:24:23,560 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:24:23,562 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:24:23,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 18:24:23,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 18:24:23,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:23,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:23,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 18:24:23,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:24:23,922 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:24:23,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:24:23,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 18:24:23,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597749554] [2025-02-05 18:24:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597749554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:24:23,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:24:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:24:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004309361] [2025-02-05 18:24:23,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:24:23,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:24:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 18:24:23,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:24:23,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:24:23,942 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:24:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:24,063 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 18:24:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:24:24,065 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:24:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:24,069 INFO L225 Difference]: With dead ends: 18 [2025-02-05 18:24:24,069 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 18:24:24,071 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:24:24,073 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:24,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 18:24:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 18:24:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 18:24:24,087 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:24:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 18:24:24,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 18:24:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:24,090 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 18:24:24,090 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:24:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 18:24:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 18:24:24,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:24,090 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 18:24:24,100 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:24:24,291 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:24:24,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:24,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 18:24:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:24:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573627323] [2025-02-05 18:24:24,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:24:24,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:24:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:24:24,297 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:24:24,298 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:24:24,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 18:24:24,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 18:24:24,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:24:24,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:24,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 18:24:24,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:24:24,847 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:24:24,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:24:25,714 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:24:25,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 18:24:25,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573627323] [2025-02-05 18:24:25,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573627323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:24:25,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 18:24:25,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 18:24:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310545875] [2025-02-05 18:24:25,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 18:24:25,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 18:24:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 18:24:25,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 18:24:25,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:24:25,718 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:24:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:24:26,060 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-05 18:24:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:24:26,061 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:24:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:24:26,061 INFO L225 Difference]: With dead ends: 15 [2025-02-05 18:24:26,061 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 18:24:26,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:24:26,062 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:24:26,062 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.3s Time] [2025-02-05 18:24:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 18:24:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-05 18:24:26,064 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:24:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-05 18:24:26,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-02-05 18:24:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:24:26,064 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-05 18:24:26,065 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:24:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-05 18:24:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 18:24:26,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:24:26,065 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-05 18:24:26,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 18:24:26,269 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:24:26,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:24:26,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:24:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-02-05 18:24:26,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:24:26,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241426844] [2025-02-05 18:24:26,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 18:24:26,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:24:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:24:26,274 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:24:26,276 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:24:26,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-05 18:24:26,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 18:24:26,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 18:24:26,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:24:26,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 18:24:26,669 INFO L279 TraceCheckSpWp]: Computing forward predicates...