./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:10:11,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:10:11,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:10:11,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:10:11,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:10:11,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:10:11,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:10:11,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:10:11,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:10:11,110 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:10:11,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:10:11,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:10:11,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:10:11,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:10:11,111 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:10:11,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:10:11,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:10:11,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:10:11,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:10:11,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:10:11,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:10:11,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:11,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:10:11,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:10:11,113 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f [2025-02-08 00:10:11,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:10:11,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:10:11,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:10:11,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:10:11,359 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:10:11,360 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.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-08 00:10:12,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6d7ba7d8/0a665fb49b82436980afb1b50d3552ea/FLAG39c9bba58 [2025-02-08 00:10:13,209 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:10:13,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-08 00:10:13,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6d7ba7d8/0a665fb49b82436980afb1b50d3552ea/FLAG39c9bba58 [2025-02-08 00:10:13,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6d7ba7d8/0a665fb49b82436980afb1b50d3552ea [2025-02-08 00:10:13,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:10:13,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:10:13,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:13,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:10:13,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:10:13,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:13" (1/1) ... [2025-02-08 00:10:13,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d5d6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:13, skipping insertion in model container [2025-02-08 00:10:13,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:13" (1/1) ... [2025-02-08 00:10:13,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:10:13,494 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2025-02-08 00:10:13,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:13,944 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:10:13,951 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2025-02-08 00:10:14,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:14,165 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:10:14,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14 WrapperNode [2025-02-08 00:10:14,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:14,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:14,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:10:14,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:10:14,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:14,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:14,735 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4880 [2025-02-08 00:10:14,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:14,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:10:14,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:10:14,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:10:14,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:14,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:14,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:14,988 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:10:14,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:14,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:15,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:15,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:15,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:15,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:15,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:10:15,339 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:10:15,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:10:15,339 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:10:15,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (1/1) ... [2025-02-08 00:10:15,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:15,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:15,371 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-08 00:10:15,377 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-08 00:10:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:10:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:10:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:10:15,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:10:15,815 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:10:15,817 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:10:20,073 INFO L? ?]: Removed 3161 outVars from TransFormulas that were not future-live. [2025-02-08 00:10:20,074 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:10:20,199 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:10:20,199 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:10:20,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:20 BoogieIcfgContainer [2025-02-08 00:10:20,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:10:20,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:10:20,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:10:20,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:10:20,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:10:13" (1/3) ... [2025-02-08 00:10:20,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca5d13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:20, skipping insertion in model container [2025-02-08 00:10:20,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:14" (2/3) ... [2025-02-08 00:10:20,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca5d13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:20, skipping insertion in model container [2025-02-08 00:10:20,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:20" (3/3) ... [2025-02-08 00:10:20,207 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-08 00:10:20,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:10:20,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c that has 1 procedures, 1128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:10:20,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:10:20,281 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;@1edd9aa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:10:20,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:10:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 1128 states, 1126 states have (on average 1.5) internal successors, (1689), 1127 states have internal predecessors, (1689), 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-08 00:10:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 00:10:20,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:20,293 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, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:20,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:20,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1867376035, now seen corresponding path program 1 times [2025-02-08 00:10:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:20,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651520971] [2025-02-08 00:10:20,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:20,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:20,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 00:10:20,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 00:10:20,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:20,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:21,169 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-08 00:10:21,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:21,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651520971] [2025-02-08 00:10:21,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651520971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:21,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251979064] [2025-02-08 00:10:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:21,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:21,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:21,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:21,194 INFO L87 Difference]: Start difference. First operand has 1128 states, 1126 states have (on average 1.5) internal successors, (1689), 1127 states have internal predecessors, (1689), 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 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-08 00:10:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:21,746 INFO L93 Difference]: Finished difference Result 2139 states and 3205 transitions. [2025-02-08 00:10:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:21,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 90 [2025-02-08 00:10:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:21,760 INFO L225 Difference]: With dead ends: 2139 [2025-02-08 00:10:21,760 INFO L226 Difference]: Without dead ends: 1128 [2025-02-08 00:10:21,764 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-08 00:10:21,766 INFO L435 NwaCegarLoop]: 1404 mSDtfsCounter, 0 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4207 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:21,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4207 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:10:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-02-08 00:10:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2025-02-08 00:10:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.497781721384206) internal successors, (1688), 1127 states have internal predecessors, (1688), 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-08 00:10:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1688 transitions. [2025-02-08 00:10:21,823 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1688 transitions. Word has length 90 [2025-02-08 00:10:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:21,823 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1688 transitions. [2025-02-08 00:10:21,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-08 00:10:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1688 transitions. [2025-02-08 00:10:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 00:10:21,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:21,825 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:21,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:10:21,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:21,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2058763039, now seen corresponding path program 1 times [2025-02-08 00:10:21,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970407230] [2025-02-08 00:10:21,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:21,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 00:10:21,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 00:10:21,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:21,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:22,299 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-08 00:10:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970407230] [2025-02-08 00:10:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970407230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875973243] [2025-02-08 00:10:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:22,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:22,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:22,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:22,305 INFO L87 Difference]: Start difference. First operand 1128 states and 1688 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-08 00:10:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:22,781 INFO L93 Difference]: Finished difference Result 2141 states and 3204 transitions. [2025-02-08 00:10:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:22,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2025-02-08 00:10:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:22,785 INFO L225 Difference]: With dead ends: 2141 [2025-02-08 00:10:22,785 INFO L226 Difference]: Without dead ends: 1130 [2025-02-08 00:10:22,787 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-08 00:10:22,788 INFO L435 NwaCegarLoop]: 1404 mSDtfsCounter, 0 mSDsluCounter, 2800 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4204 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:22,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4204 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:10:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-02-08 00:10:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2025-02-08 00:10:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.4968999114260408) internal successors, (1690), 1129 states have internal predecessors, (1690), 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-08 00:10:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1690 transitions. [2025-02-08 00:10:22,809 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1690 transitions. Word has length 91 [2025-02-08 00:10:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:22,811 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1690 transitions. [2025-02-08 00:10:22,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-08 00:10:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1690 transitions. [2025-02-08 00:10:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-08 00:10:22,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:22,816 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:22,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:10:22,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:22,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1328655646, now seen corresponding path program 1 times [2025-02-08 00:10:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928418667] [2025-02-08 00:10:22,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:22,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 00:10:22,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 00:10:22,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:22,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:23,615 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-08 00:10:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928418667] [2025-02-08 00:10:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928418667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:23,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:23,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:10:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602440164] [2025-02-08 00:10:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:23,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:10:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:23,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:10:23,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:10:23,616 INFO L87 Difference]: Start difference. First operand 1130 states and 1690 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 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-08 00:10:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:24,326 INFO L93 Difference]: Finished difference Result 2147 states and 3211 transitions. [2025-02-08 00:10:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:10:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 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 92 [2025-02-08 00:10:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:24,334 INFO L225 Difference]: With dead ends: 2147 [2025-02-08 00:10:24,334 INFO L226 Difference]: Without dead ends: 1134 [2025-02-08 00:10:24,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:24,340 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1608 mSDsluCounter, 4186 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 5584 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:24,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 5584 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:10:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-02-08 00:10:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1133. [2025-02-08 00:10:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.495583038869258) internal successors, (1693), 1132 states have internal predecessors, (1693), 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-08 00:10:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1693 transitions. [2025-02-08 00:10:24,383 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1693 transitions. Word has length 92 [2025-02-08 00:10:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:24,383 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1693 transitions. [2025-02-08 00:10:24,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 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-08 00:10:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1693 transitions. [2025-02-08 00:10:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 00:10:24,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:24,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:24,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:10:24,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1627949470, now seen corresponding path program 1 times [2025-02-08 00:10:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154251702] [2025-02-08 00:10:24,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:24,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 00:10:24,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 00:10:24,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:24,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:25,553 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-08 00:10:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154251702] [2025-02-08 00:10:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154251702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:25,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:25,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:10:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446872588] [2025-02-08 00:10:25,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:25,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:10:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:25,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:10:25,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:10:25,557 INFO L87 Difference]: Start difference. First operand 1133 states and 1693 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 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-08 00:10:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:27,040 INFO L93 Difference]: Finished difference Result 3063 states and 4576 transitions. [2025-02-08 00:10:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:10:27,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-02-08 00:10:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:27,049 INFO L225 Difference]: With dead ends: 3063 [2025-02-08 00:10:27,049 INFO L226 Difference]: Without dead ends: 2047 [2025-02-08 00:10:27,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:10:27,053 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 4336 mSDsluCounter, 8250 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4336 SdHoareTripleChecker+Valid, 9626 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:27,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4336 Valid, 9626 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:10:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-02-08 00:10:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1152. [2025-02-08 00:10:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.4943527367506515) internal successors, (1720), 1151 states have internal predecessors, (1720), 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-08 00:10:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1720 transitions. [2025-02-08 00:10:27,094 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1720 transitions. Word has length 93 [2025-02-08 00:10:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:27,095 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1720 transitions. [2025-02-08 00:10:27,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 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-08 00:10:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1720 transitions. [2025-02-08 00:10:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 00:10:27,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:27,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:27,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:10:27,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:27,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -510760071, now seen corresponding path program 1 times [2025-02-08 00:10:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528196177] [2025-02-08 00:10:27,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:27,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 00:10:27,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 00:10:27,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:27,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:27,596 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-08 00:10:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:27,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528196177] [2025-02-08 00:10:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528196177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:27,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:27,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:10:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857855982] [2025-02-08 00:10:27,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:27,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:10:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:27,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:10:27,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:27,599 INFO L87 Difference]: Start difference. First operand 1152 states and 1720 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 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-08 00:10:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:28,669 INFO L93 Difference]: Finished difference Result 3062 states and 4572 transitions. [2025-02-08 00:10:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:10:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 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 94 [2025-02-08 00:10:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:28,676 INFO L225 Difference]: With dead ends: 3062 [2025-02-08 00:10:28,677 INFO L226 Difference]: Without dead ends: 2044 [2025-02-08 00:10:28,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:10:28,680 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 4316 mSDsluCounter, 5514 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4316 SdHoareTripleChecker+Valid, 6894 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:28,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4316 Valid, 6894 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:10:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2025-02-08 00:10:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1154. [2025-02-08 00:10:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.4917606244579358) internal successors, (1720), 1153 states have internal predecessors, (1720), 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-08 00:10:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1720 transitions. [2025-02-08 00:10:28,704 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1720 transitions. Word has length 94 [2025-02-08 00:10:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:28,705 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1720 transitions. [2025-02-08 00:10:28,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 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-08 00:10:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1720 transitions. [2025-02-08 00:10:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 00:10:28,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:28,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:28,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:10:28,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:28,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:28,707 INFO L85 PathProgramCache]: Analyzing trace with hash -471347693, now seen corresponding path program 1 times [2025-02-08 00:10:28,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:28,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506986233] [2025-02-08 00:10:28,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:28,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 00:10:28,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 00:10:28,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:28,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:29,119 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-08 00:10:29,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:29,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506986233] [2025-02-08 00:10:29,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506986233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:29,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:29,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:29,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965257537] [2025-02-08 00:10:29,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:29,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:10:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:29,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:10:29,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:10:29,120 INFO L87 Difference]: Start difference. First operand 1154 states and 1720 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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-08 00:10:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:29,921 INFO L93 Difference]: Finished difference Result 3063 states and 4570 transitions. [2025-02-08 00:10:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:10:29,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-02-08 00:10:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:29,928 INFO L225 Difference]: With dead ends: 3063 [2025-02-08 00:10:29,928 INFO L226 Difference]: Without dead ends: 2038 [2025-02-08 00:10:29,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:10:29,931 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 2964 mSDsluCounter, 2761 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 4144 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:29,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 4144 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:10:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2025-02-08 00:10:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1148. [2025-02-08 00:10:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4925893635571055) internal successors, (1712), 1147 states have internal predecessors, (1712), 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-08 00:10:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1712 transitions. [2025-02-08 00:10:29,959 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1712 transitions. Word has length 95 [2025-02-08 00:10:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:29,959 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1712 transitions. [2025-02-08 00:10:29,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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-08 00:10:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1712 transitions. [2025-02-08 00:10:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 00:10:29,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:29,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:29,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:10:29,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:29,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash -645964761, now seen corresponding path program 1 times [2025-02-08 00:10:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:29,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449861892] [2025-02-08 00:10:29,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:30,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 00:10:30,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 00:10:30,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:30,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:30,756 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-08 00:10:30,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449861892] [2025-02-08 00:10:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449861892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:30,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:30,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762916451] [2025-02-08 00:10:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:30,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:10:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:30,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:10:30,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:10:30,761 INFO L87 Difference]: Start difference. First operand 1148 states and 1712 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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-08 00:10:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:31,729 INFO L93 Difference]: Finished difference Result 2198 states and 3277 transitions. [2025-02-08 00:10:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:10:31,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-02-08 00:10:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:31,733 INFO L225 Difference]: With dead ends: 2198 [2025-02-08 00:10:31,733 INFO L226 Difference]: Without dead ends: 1175 [2025-02-08 00:10:31,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:10:31,739 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1740 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 4159 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:31,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 4159 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:10:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-02-08 00:10:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1148. [2025-02-08 00:10:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4917175239755884) internal successors, (1711), 1147 states have internal predecessors, (1711), 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-08 00:10:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1711 transitions. [2025-02-08 00:10:31,775 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1711 transitions. Word has length 95 [2025-02-08 00:10:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:31,775 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1711 transitions. [2025-02-08 00:10:31,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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-08 00:10:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1711 transitions. [2025-02-08 00:10:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 00:10:31,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:31,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:31,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:10:31,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:31,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 711056495, now seen corresponding path program 1 times [2025-02-08 00:10:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010446161] [2025-02-08 00:10:31,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:31,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 00:10:31,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 00:10:31,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:31,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:32,401 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-08 00:10:32,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:32,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010446161] [2025-02-08 00:10:32,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010446161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:32,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:10:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527411161] [2025-02-08 00:10:32,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:32,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:10:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:32,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:10:32,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:32,405 INFO L87 Difference]: Start difference. First operand 1148 states and 1711 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-08 00:10:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:33,324 INFO L93 Difference]: Finished difference Result 2191 states and 3266 transitions. [2025-02-08 00:10:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:10:33,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 96 [2025-02-08 00:10:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:33,328 INFO L225 Difference]: With dead ends: 2191 [2025-02-08 00:10:33,328 INFO L226 Difference]: Without dead ends: 1175 [2025-02-08 00:10:33,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:33,330 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 16 mSDsluCounter, 7011 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8418 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:33,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8418 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:10:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-02-08 00:10:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1172. [2025-02-08 00:10:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.4876174210076858) internal successors, (1742), 1171 states have internal predecessors, (1742), 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-08 00:10:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1742 transitions. [2025-02-08 00:10:33,345 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1742 transitions. Word has length 96 [2025-02-08 00:10:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:33,346 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1742 transitions. [2025-02-08 00:10:33,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-08 00:10:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1742 transitions. [2025-02-08 00:10:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 00:10:33,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:33,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:33,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:10:33,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:33,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 95016406, now seen corresponding path program 1 times [2025-02-08 00:10:33,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:33,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899236587] [2025-02-08 00:10:33,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:33,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 00:10:33,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 00:10:33,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:33,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:33,815 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-08 00:10:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899236587] [2025-02-08 00:10:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899236587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:33,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 00:10:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726937188] [2025-02-08 00:10:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:33,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:10:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:33,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:10:33,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:10:33,817 INFO L87 Difference]: Start difference. First operand 1172 states and 1742 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 9 states have internal predecessors, (97), 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-08 00:10:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:34,602 INFO L93 Difference]: Finished difference Result 2249 states and 3348 transitions. [2025-02-08 00:10:34,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:10:34,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 9 states have internal predecessors, (97), 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 97 [2025-02-08 00:10:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:34,606 INFO L225 Difference]: With dead ends: 2249 [2025-02-08 00:10:34,606 INFO L226 Difference]: Without dead ends: 1216 [2025-02-08 00:10:34,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:10:34,611 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 1788 mSDsluCounter, 4273 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 5653 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:34,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1788 Valid, 5653 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:10:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-02-08 00:10:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1186. [2025-02-08 00:10:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 1.4860759493670885) internal successors, (1761), 1185 states have internal predecessors, (1761), 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-08 00:10:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1761 transitions. [2025-02-08 00:10:34,628 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1761 transitions. Word has length 97 [2025-02-08 00:10:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:34,628 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1761 transitions. [2025-02-08 00:10:34,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 9 states have internal predecessors, (97), 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-08 00:10:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1761 transitions. [2025-02-08 00:10:34,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 00:10:34,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:34,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:34,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:10:34,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:34,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1920220544, now seen corresponding path program 1 times [2025-02-08 00:10:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:34,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726839770] [2025-02-08 00:10:34,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:34,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 00:10:34,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 00:10:34,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:34,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:34,928 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-08 00:10:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726839770] [2025-02-08 00:10:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726839770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93253144] [2025-02-08 00:10:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:10:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:34,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:10:34,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:10:34,930 INFO L87 Difference]: Start difference. First operand 1186 states and 1761 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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-08 00:10:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:35,430 INFO L93 Difference]: Finished difference Result 2237 states and 3329 transitions. [2025-02-08 00:10:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:10:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 97 [2025-02-08 00:10:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:35,434 INFO L225 Difference]: With dead ends: 2237 [2025-02-08 00:10:35,434 INFO L226 Difference]: Without dead ends: 1196 [2025-02-08 00:10:35,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:10:35,436 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1681 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:35,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 4160 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:10:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-02-08 00:10:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1178. [2025-02-08 00:10:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4885301614273576) internal successors, (1752), 1177 states have internal predecessors, (1752), 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-08 00:10:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1752 transitions. [2025-02-08 00:10:35,450 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1752 transitions. Word has length 97 [2025-02-08 00:10:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:35,450 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1752 transitions. [2025-02-08 00:10:35,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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-08 00:10:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1752 transitions. [2025-02-08 00:10:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 00:10:35,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:35,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:35,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:10:35,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:35,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1080359788, now seen corresponding path program 1 times [2025-02-08 00:10:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:35,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300647894] [2025-02-08 00:10:35,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:35,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 00:10:35,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 00:10:35,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:35,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:35,824 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-08 00:10:35,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:35,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300647894] [2025-02-08 00:10:35,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300647894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:35,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:35,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:10:35,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15113995] [2025-02-08 00:10:35,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:35,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:10:35,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:35,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:10:35,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:10:35,826 INFO L87 Difference]: Start difference. First operand 1178 states and 1752 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 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-08 00:10:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:36,433 INFO L93 Difference]: Finished difference Result 2233 states and 3326 transitions. [2025-02-08 00:10:36,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:10:36,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 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 98 [2025-02-08 00:10:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:36,437 INFO L225 Difference]: With dead ends: 2233 [2025-02-08 00:10:36,437 INFO L226 Difference]: Without dead ends: 1200 [2025-02-08 00:10:36,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:10:36,439 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 1780 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 4224 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:36,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 4224 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:10:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2025-02-08 00:10:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1184. [2025-02-08 00:10:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.4877430262045646) internal successors, (1760), 1183 states have internal predecessors, (1760), 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-08 00:10:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1760 transitions. [2025-02-08 00:10:36,456 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1760 transitions. Word has length 98 [2025-02-08 00:10:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:36,457 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1760 transitions. [2025-02-08 00:10:36,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 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-08 00:10:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1760 transitions. [2025-02-08 00:10:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 00:10:36,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:36,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:10:36,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -925398362, now seen corresponding path program 1 times [2025-02-08 00:10:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592909253] [2025-02-08 00:10:36,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:36,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 00:10:36,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 00:10:36,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:36,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:36,745 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-08 00:10:36,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:36,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592909253] [2025-02-08 00:10:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592909253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:36,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:36,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:10:36,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107588935] [2025-02-08 00:10:36,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:36,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:10:36,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:36,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:10:36,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:10:36,748 INFO L87 Difference]: Start difference. First operand 1184 states and 1760 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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-08 00:10:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:37,278 INFO L93 Difference]: Finished difference Result 2230 states and 3321 transitions. [2025-02-08 00:10:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:10:37,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2025-02-08 00:10:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:37,282 INFO L225 Difference]: With dead ends: 2230 [2025-02-08 00:10:37,282 INFO L226 Difference]: Without dead ends: 1197 [2025-02-08 00:10:37,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:37,284 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1759 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:37,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 4156 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:10:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2025-02-08 00:10:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1184. [2025-02-08 00:10:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.4868977176669484) internal successors, (1759), 1183 states have internal predecessors, (1759), 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-08 00:10:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1759 transitions. [2025-02-08 00:10:37,299 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1759 transitions. Word has length 99 [2025-02-08 00:10:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:37,299 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1759 transitions. [2025-02-08 00:10:37,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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-08 00:10:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1759 transitions. [2025-02-08 00:10:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 00:10:37,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:37,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:37,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:10:37,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:37,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1368803813, now seen corresponding path program 1 times [2025-02-08 00:10:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:37,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107119073] [2025-02-08 00:10:37,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:37,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 00:10:37,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 00:10:37,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:37,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:37,677 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-08 00:10:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107119073] [2025-02-08 00:10:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107119073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:10:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858642015] [2025-02-08 00:10:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:37,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:10:37,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:37,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:10:37,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:37,679 INFO L87 Difference]: Start difference. First operand 1184 states and 1759 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 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-08 00:10:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:38,349 INFO L93 Difference]: Finished difference Result 2234 states and 3326 transitions. [2025-02-08 00:10:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:10:38,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-02-08 00:10:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:38,354 INFO L225 Difference]: With dead ends: 2234 [2025-02-08 00:10:38,355 INFO L226 Difference]: Without dead ends: 1201 [2025-02-08 00:10:38,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:10:38,357 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 1724 mSDsluCounter, 4184 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 5569 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:38,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 5569 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:10:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-02-08 00:10:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1189. [2025-02-08 00:10:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 1.4865319865319866) internal successors, (1766), 1188 states have internal predecessors, (1766), 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-08 00:10:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1766 transitions. [2025-02-08 00:10:38,371 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1766 transitions. Word has length 99 [2025-02-08 00:10:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:38,372 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1766 transitions. [2025-02-08 00:10:38,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 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-08 00:10:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1766 transitions. [2025-02-08 00:10:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 00:10:38,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:38,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:38,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:10:38,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:38,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 486655773, now seen corresponding path program 1 times [2025-02-08 00:10:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:38,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68642320] [2025-02-08 00:10:38,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:38,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:38,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 00:10:38,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 00:10:38,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:38,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:38,662 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-08 00:10:38,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:38,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68642320] [2025-02-08 00:10:38,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68642320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:38,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:38,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:10:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918905845] [2025-02-08 00:10:38,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:38,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:10:38,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:38,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:10:38,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:38,664 INFO L87 Difference]: Start difference. First operand 1189 states and 1766 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 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-08 00:10:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:39,485 INFO L93 Difference]: Finished difference Result 2240 states and 3331 transitions. [2025-02-08 00:10:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:10:39,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 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 99 [2025-02-08 00:10:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:39,488 INFO L225 Difference]: With dead ends: 2240 [2025-02-08 00:10:39,488 INFO L226 Difference]: Without dead ends: 1189 [2025-02-08 00:10:39,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:10:39,489 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1669 mSDsluCounter, 5536 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 6923 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:39,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 6923 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:10:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2025-02-08 00:10:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1179. [2025-02-08 00:10:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1178 states have (on average 1.4855687606112054) internal successors, (1750), 1178 states have internal predecessors, (1750), 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-08 00:10:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1750 transitions. [2025-02-08 00:10:39,501 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1750 transitions. Word has length 99 [2025-02-08 00:10:39,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:39,502 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1750 transitions. [2025-02-08 00:10:39,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 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-08 00:10:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1750 transitions. [2025-02-08 00:10:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 00:10:39,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:39,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:39,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:10:39,503 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:39,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1718772935, now seen corresponding path program 1 times [2025-02-08 00:10:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:39,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751083659] [2025-02-08 00:10:39,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:39,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:39,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 00:10:39,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 00:10:39,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:39,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:39,834 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-08 00:10:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751083659] [2025-02-08 00:10:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751083659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:39,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:10:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375073506] [2025-02-08 00:10:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:10:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:10:39,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:10:39,836 INFO L87 Difference]: Start difference. First operand 1179 states and 1750 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 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-08 00:10:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:40,610 INFO L93 Difference]: Finished difference Result 2226 states and 3312 transitions. [2025-02-08 00:10:40,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:10:40,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 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 100 [2025-02-08 00:10:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:40,613 INFO L225 Difference]: With dead ends: 2226 [2025-02-08 00:10:40,613 INFO L226 Difference]: Without dead ends: 1193 [2025-02-08 00:10:40,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:10:40,615 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 1740 mSDsluCounter, 5528 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 6912 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:40,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 6912 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:10:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-02-08 00:10:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1185. [2025-02-08 00:10:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4847972972972974) internal successors, (1758), 1184 states have internal predecessors, (1758), 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-08 00:10:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1758 transitions. [2025-02-08 00:10:40,627 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1758 transitions. Word has length 100 [2025-02-08 00:10:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:40,628 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1758 transitions. [2025-02-08 00:10:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 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-08 00:10:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1758 transitions. [2025-02-08 00:10:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 00:10:40,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:40,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:10:40,629 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:40,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1663620772, now seen corresponding path program 1 times [2025-02-08 00:10:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:40,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109991680] [2025-02-08 00:10:40,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:40,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 00:10:40,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 00:10:40,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:40,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:40,893 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-08 00:10:40,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:40,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109991680] [2025-02-08 00:10:40,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109991680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:40,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:40,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678046556] [2025-02-08 00:10:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:40,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:10:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:40,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:10:40,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:10:40,897 INFO L87 Difference]: Start difference. First operand 1185 states and 1758 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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-08 00:10:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:41,430 INFO L93 Difference]: Finished difference Result 2227 states and 3312 transitions. [2025-02-08 00:10:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:10:41,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 100 [2025-02-08 00:10:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:41,433 INFO L225 Difference]: With dead ends: 2227 [2025-02-08 00:10:41,433 INFO L226 Difference]: Without dead ends: 1188 [2025-02-08 00:10:41,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:41,435 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1690 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 4157 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:41,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 4157 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:10:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-02-08 00:10:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1182. [2025-02-08 00:10:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.4843353090601186) internal successors, (1753), 1181 states have internal predecessors, (1753), 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-08 00:10:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1753 transitions. [2025-02-08 00:10:41,449 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1753 transitions. Word has length 100 [2025-02-08 00:10:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:41,449 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1753 transitions. [2025-02-08 00:10:41,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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-08 00:10:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1753 transitions. [2025-02-08 00:10:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 00:10:41,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:41,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:41,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:10:41,450 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1914575004, now seen corresponding path program 1 times [2025-02-08 00:10:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:41,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466313673] [2025-02-08 00:10:41,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:41,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:41,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 00:10:41,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 00:10:41,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:41,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:41,672 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-08 00:10:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:41,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466313673] [2025-02-08 00:10:41,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466313673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:41,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:41,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:10:41,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353403157] [2025-02-08 00:10:41,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:41,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:10:41,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:41,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:10:41,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:10:41,675 INFO L87 Difference]: Start difference. First operand 1182 states and 1753 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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-08 00:10:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:42,203 INFO L93 Difference]: Finished difference Result 2218 states and 3299 transitions. [2025-02-08 00:10:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:10:42,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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 101 [2025-02-08 00:10:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:42,206 INFO L225 Difference]: With dead ends: 2218 [2025-02-08 00:10:42,207 INFO L226 Difference]: Without dead ends: 1185 [2025-02-08 00:10:42,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:10:42,208 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1681 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 4157 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:42,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 4157 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:10:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-02-08 00:10:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1182. [2025-02-08 00:10:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.4834885690093143) internal successors, (1752), 1181 states have internal predecessors, (1752), 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-08 00:10:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1752 transitions. [2025-02-08 00:10:42,223 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1752 transitions. Word has length 101 [2025-02-08 00:10:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:42,223 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1752 transitions. [2025-02-08 00:10:42,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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-08 00:10:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1752 transitions. [2025-02-08 00:10:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 00:10:42,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:42,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:10:42,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:10:42,226 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:42,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:42,226 INFO L85 PathProgramCache]: Analyzing trace with hash 66809056, now seen corresponding path program 1 times [2025-02-08 00:10:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:42,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949272529] [2025-02-08 00:10:42,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:42,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 00:10:42,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 00:10:42,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:42,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:42,822 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-08 00:10:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:42,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949272529] [2025-02-08 00:10:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949272529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:42,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:42,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:10:42,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428882088] [2025-02-08 00:10:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:42,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:10:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:42,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:10:42,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:10:42,823 INFO L87 Difference]: Start difference. First operand 1182 states and 1752 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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-08 00:10:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:43,766 INFO L93 Difference]: Finished difference Result 2222 states and 3304 transitions. [2025-02-08 00:10:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:10:43,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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 101 [2025-02-08 00:10:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:43,769 INFO L225 Difference]: With dead ends: 2222 [2025-02-08 00:10:43,770 INFO L226 Difference]: Without dead ends: 1189 [2025-02-08 00:10:43,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:10:43,772 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 1683 mSDsluCounter, 6927 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 8310 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:43,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 8310 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:10:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2025-02-08 00:10:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1185. [2025-02-08 00:10:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4831081081081081) internal successors, (1756), 1184 states have internal predecessors, (1756), 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-08 00:10:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1756 transitions. [2025-02-08 00:10:43,787 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1756 transitions. Word has length 101 [2025-02-08 00:10:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:43,787 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1756 transitions. [2025-02-08 00:10:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 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-08 00:10:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1756 transitions. [2025-02-08 00:10:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 00:10:43,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:43,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:43,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:10:43,788 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:43,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1821774754, now seen corresponding path program 1 times [2025-02-08 00:10:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406207174] [2025-02-08 00:10:43,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:43,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 00:10:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 00:10:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:44,466 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-08 00:10:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:10:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406207174] [2025-02-08 00:10:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406207174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:44,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-08 00:10:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976211983] [2025-02-08 00:10:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 00:10:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:10:44,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 00:10:44,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-08 00:10:44,469 INFO L87 Difference]: Start difference. First operand 1185 states and 1756 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 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-08 00:10:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:46,715 INFO L93 Difference]: Finished difference Result 2248 states and 3343 transitions. [2025-02-08 00:10:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 00:10:46,716 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 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 101 [2025-02-08 00:10:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:46,719 INFO L225 Difference]: With dead ends: 2248 [2025-02-08 00:10:46,723 INFO L226 Difference]: Without dead ends: 1215 [2025-02-08 00:10:46,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:10:46,725 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 1653 mSDsluCounter, 22234 mSDsCounter, 0 mSdLazyCounter, 5457 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 23627 SdHoareTripleChecker+Invalid, 5458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:46,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 23627 Invalid, 5458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5457 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 00:10:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-02-08 00:10:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1205. [2025-02-08 00:10:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.4858803986710964) internal successors, (1789), 1204 states have internal predecessors, (1789), 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-08 00:10:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1789 transitions. [2025-02-08 00:10:46,745 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1789 transitions. Word has length 101 [2025-02-08 00:10:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:46,745 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1789 transitions. [2025-02-08 00:10:46,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 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-08 00:10:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1789 transitions. [2025-02-08 00:10:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 00:10:46,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:46,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:46,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:10:46,746 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:46,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash 773840990, now seen corresponding path program 1 times [2025-02-08 00:10:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:10:46,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932947611] [2025-02-08 00:10:46,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:10:46,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 00:10:46,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 00:10:46,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:46,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:10:46,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:10:46,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 00:10:46,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 00:10:46,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:10:46,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:10:46,952 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:10:46,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:10:46,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:10:46,957 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:10:47,028 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:10:47,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:10:47,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:10:47 BoogieIcfgContainer [2025-02-08 00:10:47,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:10:47,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:10:47,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:10:47,065 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:10:47,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:20" (3/4) ... [2025-02-08 00:10:47,068 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:10:47,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:10:47,074 INFO L158 Benchmark]: Toolchain (without parser) took 33813.33ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 981.5MB). Free memory was 131.4MB in the beginning and 639.1MB in the end (delta: -507.7MB). Peak memory consumption was 480.4MB. Max. memory is 16.1GB. [2025-02-08 00:10:47,074 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:10:47,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 909.01ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 46.8MB in the end (delta: 84.6MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-02-08 00:10:47,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 568.73ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 46.8MB in the beginning and 91.3MB in the end (delta: -44.5MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2025-02-08 00:10:47,074 INFO L158 Benchmark]: Boogie Preprocessor took 601.44ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 91.3MB in the beginning and 255.9MB in the end (delta: -164.5MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2025-02-08 00:10:47,074 INFO L158 Benchmark]: IcfgBuilder took 4861.39ms. Allocated memory was 369.1MB in the beginning and 755.0MB in the end (delta: 385.9MB). Free memory was 255.9MB in the beginning and 488.8MB in the end (delta: -233.0MB). Peak memory consumption was 200.3MB. Max. memory is 16.1GB. [2025-02-08 00:10:47,075 INFO L158 Benchmark]: TraceAbstraction took 26862.04ms. Allocated memory was 755.0MB in the beginning and 1.1GB in the end (delta: 394.3MB). Free memory was 488.8MB in the beginning and 639.3MB in the end (delta: -150.4MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. [2025-02-08 00:10:47,075 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 1.1GB. Free memory was 639.3MB in the beginning and 639.1MB in the end (delta: 154.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:10:47,075 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 909.01ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 46.8MB in the end (delta: 84.6MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 568.73ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 46.8MB in the beginning and 91.3MB in the end (delta: -44.5MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 601.44ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 91.3MB in the beginning and 255.9MB in the end (delta: -164.5MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * IcfgBuilder took 4861.39ms. Allocated memory was 369.1MB in the beginning and 755.0MB in the end (delta: 385.9MB). Free memory was 255.9MB in the beginning and 488.8MB in the end (delta: -233.0MB). Peak memory consumption was 200.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26862.04ms. Allocated memory was 755.0MB in the beginning and 1.1GB in the end (delta: 394.3MB). Free memory was 488.8MB in the beginning and 639.3MB in the end (delta: -150.4MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 1.1GB. Free memory was 639.3MB in the beginning and 639.1MB in the end (delta: 154.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 409. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_33 = 8; [L48] const SORT_21 var_37 = 0; [L49] const SORT_21 var_46 = 16; [L50] const SORT_21 var_49 = 32; [L51] const SORT_21 var_52 = 64; [L52] const SORT_3 var_57 = 1; [L53] const SORT_3 var_61 = 0; [L54] const SORT_6 var_146 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_368; [L72] SORT_3 input_390; [L73] SORT_3 input_405; [L74] SORT_3 input_420; [L75] SORT_3 input_435; [L76] SORT_3 input_450; [L77] SORT_3 input_465; [L78] SORT_3 input_480; [L79] SORT_3 input_495; [L80] SORT_3 input_510; [L81] SORT_3 input_525; [L82] SORT_3 input_540; [L83] SORT_3 input_555; [L84] SORT_3 input_570; [L85] SORT_3 input_585; [L86] SORT_3 input_600; [L87] SORT_3 input_616; [L88] SORT_3 input_618; [L89] SORT_3 input_620; [L90] SORT_3 input_622; [L91] SORT_3 input_624; [L92] SORT_3 input_626; [L93] SORT_3 input_628; [L94] SORT_3 input_630; [L95] SORT_3 input_635; [L96] SORT_21 input_676; [L97] SORT_21 input_677; [L98] SORT_21 input_678; [L99] SORT_21 input_679; [L100] SORT_21 input_682; [L101] SORT_21 input_686; [L102] SORT_21 input_690; [L103] SORT_21 input_698; [L104] SORT_21 input_702; [L105] SORT_21 input_704; [L106] SORT_21 input_708; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_720; [L110] SORT_21 input_724; [L111] SORT_21 input_729; [L112] SORT_21 input_731; [L113] SORT_21 input_732; [L114] SORT_21 input_734; [L115] SORT_21 input_738; [L116] SORT_21 input_743; [L117] SORT_21 input_750; [L118] SORT_21 input_751; [L119] SORT_21 input_753; [L120] SORT_21 input_757; [L121] SORT_21 input_762; [L122] SORT_21 input_764; [L123] SORT_21 input_765; [L124] SORT_21 input_767; [L125] SORT_21 input_771; [L126] SORT_21 input_776; [L127] SORT_21 input_780; [L128] SORT_21 input_785; [L129] SORT_21 input_787; [L130] SORT_21 input_793; [L131] SORT_21 input_805; [L132] SORT_3 input_810; [L133] SORT_3 input_819; [L134] SORT_3 input_838; [L135] SORT_3 input_845; [L136] SORT_3 input_856; [L137] SORT_3 input_862; [L138] SORT_3 input_868; [L139] SORT_3 input_874; [L140] SORT_3 input_880; [L141] SORT_3 input_886; [L142] SORT_3 input_892; [L143] SORT_3 input_898; [L144] SORT_3 input_904; [L145] SORT_3 input_910; [L146] SORT_3 input_916; [L147] SORT_3 input_922; [L148] SORT_3 input_928; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L151] SORT_21 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L152] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L153] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L154] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L155] SORT_3 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L156] SORT_3 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L157] SORT_3 state_78 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L158] SORT_3 state_94 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L159] SORT_3 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L160] SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L161] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L162] SORT_3 state_120 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L163] SORT_3 state_124 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L164] SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L165] SORT_3 state_132 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L166] SORT_3 state_142 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L167] SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L168] SORT_3 state_152 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L169] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L170] SORT_3 state_166 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L171] SORT_3 state_169 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L172] SORT_3 state_181 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L173] SORT_3 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L174] SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L175] SORT_3 state_199 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L176] SORT_3 state_208 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L177] SORT_3 state_221 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L178] SORT_3 state_234 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_21 init_32_arg_1 = var_22; [L183] state_31 = init_32_arg_1 [L184] SORT_3 init_63_arg_1 = var_61; [L185] state_62 = init_63_arg_1 [L186] SORT_3 init_65_arg_1 = var_61; [L187] state_64 = init_65_arg_1 [L188] SORT_3 init_67_arg_1 = var_61; [L189] state_66 = init_67_arg_1 [L190] SORT_3 init_71_arg_1 = var_61; [L191] state_70 = init_71_arg_1 [L192] SORT_3 init_75_arg_1 = var_61; [L193] state_74 = init_75_arg_1 [L194] SORT_3 init_79_arg_1 = var_61; [L195] state_78 = init_79_arg_1 [L196] SORT_3 init_95_arg_1 = var_61; [L197] state_94 = init_95_arg_1 [L198] SORT_3 init_112_arg_1 = var_61; [L199] state_111 = init_112_arg_1 [L200] SORT_3 init_115_arg_1 = var_61; [L201] state_114 = init_115_arg_1 [L202] SORT_3 init_117_arg_1 = var_61; [L203] state_116 = init_117_arg_1 [L204] SORT_3 init_121_arg_1 = var_61; [L205] state_120 = init_121_arg_1 [L206] SORT_3 init_125_arg_1 = var_61; [L207] state_124 = init_125_arg_1 [L208] SORT_3 init_130_arg_1 = var_61; [L209] state_129 = init_130_arg_1 [L210] SORT_3 init_133_arg_1 = var_61; [L211] state_132 = init_133_arg_1 [L212] SORT_3 init_143_arg_1 = var_61; [L213] state_142 = init_143_arg_1 [L214] SORT_3 init_150_arg_1 = var_61; [L215] state_149 = init_150_arg_1 [L216] SORT_3 init_153_arg_1 = var_61; [L217] state_152 = init_153_arg_1 [L218] SORT_3 init_162_arg_1 = var_61; [L219] state_161 = init_162_arg_1 [L220] SORT_3 init_167_arg_1 = var_61; [L221] state_166 = init_167_arg_1 [L222] SORT_3 init_170_arg_1 = var_61; [L223] state_169 = init_170_arg_1 [L224] SORT_3 init_182_arg_1 = var_61; [L225] state_181 = init_182_arg_1 [L226] SORT_3 init_192_arg_1 = var_61; [L227] state_191 = init_192_arg_1 [L228] SORT_3 init_197_arg_1 = var_61; [L229] state_196 = init_197_arg_1 [L230] SORT_3 init_200_arg_1 = var_61; [L231] state_199 = init_200_arg_1 [L232] SORT_3 init_209_arg_1 = var_61; [L233] state_208 = init_209_arg_1 [L234] SORT_3 init_222_arg_1 = var_61; [L235] state_221 = init_222_arg_1 [L236] SORT_3 init_235_arg_1 = var_61; [L237] state_234 = init_235_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_368 = __VERIFIER_nondet_uchar() [L257] input_390 = __VERIFIER_nondet_uchar() [L258] input_405 = __VERIFIER_nondet_uchar() [L259] input_420 = __VERIFIER_nondet_uchar() [L260] input_435 = __VERIFIER_nondet_uchar() [L261] input_450 = __VERIFIER_nondet_uchar() [L262] input_465 = __VERIFIER_nondet_uchar() [L263] input_480 = __VERIFIER_nondet_uchar() [L264] input_495 = __VERIFIER_nondet_uchar() [L265] input_510 = __VERIFIER_nondet_uchar() [L266] input_525 = __VERIFIER_nondet_uchar() [L267] input_540 = __VERIFIER_nondet_uchar() [L268] input_555 = __VERIFIER_nondet_uchar() [L269] input_570 = __VERIFIER_nondet_uchar() [L270] input_585 = __VERIFIER_nondet_uchar() [L271] input_600 = __VERIFIER_nondet_uchar() [L272] input_616 = __VERIFIER_nondet_uchar() [L273] input_618 = __VERIFIER_nondet_uchar() [L274] input_620 = __VERIFIER_nondet_uchar() [L275] input_622 = __VERIFIER_nondet_uchar() [L276] input_624 = __VERIFIER_nondet_uchar() [L277] input_626 = __VERIFIER_nondet_uchar() [L278] input_628 = __VERIFIER_nondet_uchar() [L279] input_630 = __VERIFIER_nondet_uchar() [L280] input_635 = __VERIFIER_nondet_uchar() [L281] input_676 = __VERIFIER_nondet_uchar() [L282] input_677 = __VERIFIER_nondet_uchar() [L283] input_678 = __VERIFIER_nondet_uchar() [L284] input_679 = __VERIFIER_nondet_uchar() [L285] input_682 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_690 = __VERIFIER_nondet_uchar() [L288] input_698 = __VERIFIER_nondet_uchar() [L289] input_702 = __VERIFIER_nondet_uchar() [L290] input_704 = __VERIFIER_nondet_uchar() [L291] input_708 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_720 = __VERIFIER_nondet_uchar() [L295] input_724 = __VERIFIER_nondet_uchar() [L296] input_729 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_732 = __VERIFIER_nondet_uchar() [L299] input_734 = __VERIFIER_nondet_uchar() [L300] input_738 = __VERIFIER_nondet_uchar() [L301] input_743 = __VERIFIER_nondet_uchar() [L302] input_750 = __VERIFIER_nondet_uchar() [L303] input_751 = __VERIFIER_nondet_uchar() [L304] input_753 = __VERIFIER_nondet_uchar() [L305] input_757 = __VERIFIER_nondet_uchar() [L306] input_762 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_765 = __VERIFIER_nondet_uchar() [L309] input_767 = __VERIFIER_nondet_uchar() [L310] input_771 = __VERIFIER_nondet_uchar() [L311] input_776 = __VERIFIER_nondet_uchar() [L312] input_780 = __VERIFIER_nondet_uchar() [L313] input_785 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_793 = __VERIFIER_nondet_uchar() [L316] input_805 = __VERIFIER_nondet_uchar() [L317] input_810 = __VERIFIER_nondet_uchar() [L318] input_819 = __VERIFIER_nondet_uchar() [L319] input_838 = __VERIFIER_nondet_uchar() [L320] input_845 = __VERIFIER_nondet_uchar() [L321] input_856 = __VERIFIER_nondet_uchar() [L322] input_862 = __VERIFIER_nondet_uchar() [L323] input_868 = __VERIFIER_nondet_uchar() [L324] input_874 = __VERIFIER_nondet_uchar() [L325] input_880 = __VERIFIER_nondet_uchar() [L326] input_886 = __VERIFIER_nondet_uchar() [L327] input_892 = __VERIFIER_nondet_uchar() [L328] input_898 = __VERIFIER_nondet_uchar() [L329] input_904 = __VERIFIER_nondet_uchar() [L330] input_910 = __VERIFIER_nondet_uchar() [L331] input_916 = __VERIFIER_nondet_uchar() [L332] input_922 = __VERIFIER_nondet_uchar() [L333] input_928 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_21 var_34_arg_0 = state_31; [L349] SORT_21 var_34_arg_1 = var_33; [L350] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L351] SORT_21 var_35_arg_0 = state_31; [L352] SORT_21 var_35_arg_1 = var_22; [L353] SORT_3 var_35 = var_35_arg_0 == var_35_arg_1; [L354] SORT_3 var_36_arg_0 = var_34; [L355] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_36_arg_0=0, var_36_arg_1=1, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L356] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L356] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L357] SORT_21 var_38_arg_0 = state_31; [L358] SORT_21 var_38_arg_1 = var_37; [L359] SORT_3 var_38 = var_38_arg_0 == var_38_arg_1; [L360] SORT_3 var_39_arg_0 = var_36; [L361] SORT_3 var_39_arg_1 = var_38; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_39_arg_0=1, var_39_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L362] EXPR var_39_arg_0 | var_39_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L362] SORT_3 var_39 = var_39_arg_0 | var_39_arg_1; [L363] SORT_21 var_40_arg_0 = state_31; [L364] SORT_21 var_40_arg_1 = var_29; [L365] SORT_3 var_40 = var_40_arg_0 == var_40_arg_1; [L366] SORT_3 var_41_arg_0 = var_39; [L367] SORT_3 var_41_arg_1 = var_40; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_41_arg_0=1, var_41_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L368] EXPR var_41_arg_0 | var_41_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L368] SORT_3 var_41 = var_41_arg_0 | var_41_arg_1; [L369] SORT_3 var_42_arg_0 = var_30; [L370] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_42_arg_0=0, var_42_arg_1=1, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L371] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L371] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_28; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_43_arg_0=1, var_43_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_44_arg_0 = state_23; [L376] SORT_21 var_44_arg_1 = var_33; [L377] SORT_3 var_44 = var_44_arg_0 == var_44_arg_1; [L378] SORT_3 var_45_arg_0 = var_43; [L379] SORT_3 var_45_arg_1 = var_44; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_45_arg_0=1, var_45_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L380] EXPR var_45_arg_0 | var_45_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L380] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L381] SORT_21 var_47_arg_0 = state_23; [L382] SORT_21 var_47_arg_1 = var_46; [L383] SORT_3 var_47 = var_47_arg_0 == var_47_arg_1; [L384] SORT_3 var_48_arg_0 = var_45; [L385] SORT_3 var_48_arg_1 = var_47; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_48_arg_0=1, var_48_arg_1=0, var_49=32, var_52=64, var_57=1, var_61=0] [L386] EXPR var_48_arg_0 | var_48_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L386] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L387] SORT_21 var_50_arg_0 = state_23; [L388] SORT_21 var_50_arg_1 = var_49; [L389] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L390] SORT_3 var_51_arg_0 = var_48; [L391] SORT_3 var_51_arg_1 = var_50; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_51_arg_0=1, var_51_arg_1=0, var_52=64, var_57=1, var_61=0] [L392] EXPR var_51_arg_0 | var_51_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L392] SORT_3 var_51 = var_51_arg_0 | var_51_arg_1; [L393] SORT_21 var_53_arg_0 = state_23; [L394] SORT_21 var_53_arg_1 = var_52; [L395] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L396] SORT_3 var_54_arg_0 = var_51; [L397] SORT_3 var_54_arg_1 = var_53; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_54_arg_0=1, var_54_arg_1=0, var_57=1, var_61=0] [L398] EXPR var_54_arg_0 | var_54_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L398] SORT_3 var_54 = var_54_arg_0 | var_54_arg_1; [L399] SORT_21 var_55_arg_0 = state_23; [L400] SORT_21 var_55_arg_1 = var_37; [L401] SORT_3 var_55 = var_55_arg_0 == var_55_arg_1; [L402] SORT_3 var_56_arg_0 = var_54; [L403] SORT_3 var_56_arg_1 = var_55; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_56_arg_0=1, var_56_arg_1=0, var_57=1, var_61=0] [L404] EXPR var_56_arg_0 | var_56_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L404] SORT_3 var_56 = var_56_arg_0 | var_56_arg_1; [L405] SORT_3 var_58_arg_0 = var_56; [L406] SORT_3 var_58 = ~var_58_arg_0; [L407] SORT_3 var_59_arg_0 = var_57; [L408] SORT_3 var_59_arg_1 = var_58; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_59_arg_0=1, var_59_arg_1=-2, var_61=0] [L409] EXPR var_59_arg_0 & var_59_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L409] SORT_3 var_59 = var_59_arg_0 & var_59_arg_1; [L410] EXPR var_59 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L410] var_59 = var_59 & mask_SORT_3 [L411] SORT_3 bad_60_arg_0 = var_59; [L412] CALL __VERIFIER_assert(!(bad_60_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33828 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33828 mSDsluCounter, 125084 SdHoareTripleChecker+Invalid, 12.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98700 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27520 IncrementalHoareTripleChecker+Invalid, 27530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 26384 mSDtfsCounter, 27520 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=19, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 2836 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1940 NumberOfCodeBlocks, 1940 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1819 ConstructedInterpolants, 0 QuantifiedInterpolants, 7586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-08 00:10:47,112 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.vcegar_QF_BV_pj_icu_icctl_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:10:49,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:10:49,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:10:49,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:10:49,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:10:49,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:10:49,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:10:49,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:10:49,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:10:49,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:10:49,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:10:49,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:10:49,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:10:49,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:10:49,933 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:10:49,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:10:49,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:10:49,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:10:49,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:10:49,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:10:49,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:10:49,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:49,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:10:49,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:10:49,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:10:49,936 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f [2025-02-08 00:10:50,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:10:50,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:10:50,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:10:50,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:10:50,281 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:10:50,282 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.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-08 00:10:51,992 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5db929a/7b327595e00045779e59abfd64de4b2c/FLAGc1f684998 [2025-02-08 00:10:52,307 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:10:52,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-08 00:10:52,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5db929a/7b327595e00045779e59abfd64de4b2c/FLAGc1f684998 [2025-02-08 00:10:52,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5db929a/7b327595e00045779e59abfd64de4b2c [2025-02-08 00:10:52,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:10:52,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:10:52,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:52,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:10:52,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:10:52,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:52" (1/1) ... [2025-02-08 00:10:52,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35489e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:52, skipping insertion in model container [2025-02-08 00:10:52,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:10:52" (1/1) ... [2025-02-08 00:10:52,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:10:52,575 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2025-02-08 00:10:52,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:52,924 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:10:52,933 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2025-02-08 00:10:53,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:10:53,139 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:10:53,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53 WrapperNode [2025-02-08 00:10:53,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:10:53,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:53,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:10:53,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:10:53,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,328 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2640 [2025-02-08 00:10:53,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:10:53,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:10:53,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:10:53,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:10:53,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,434 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:10:53,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:10:53,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:10:53,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:10:53,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:10:53,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (1/1) ... [2025-02-08 00:10:53,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:10:53,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:53,650 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-08 00:10:53,653 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-08 00:10:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:10:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:10:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:10:53,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:10:54,010 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:10:54,011 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:10:56,203 INFO L? ?]: Removed 181 outVars from TransFormulas that were not future-live. [2025-02-08 00:10:56,203 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:10:56,210 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:10:56,211 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:10:56,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:56 BoogieIcfgContainer [2025-02-08 00:10:56,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:10:56,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:10:56,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:10:56,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:10:56,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:10:52" (1/3) ... [2025-02-08 00:10:56,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae35cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:56, skipping insertion in model container [2025-02-08 00:10:56,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:10:53" (2/3) ... [2025-02-08 00:10:56,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae35cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:10:56, skipping insertion in model container [2025-02-08 00:10:56,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:10:56" (3/3) ... [2025-02-08 00:10:56,222 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2025-02-08 00:10:56,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:10:56,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:10:56,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:10:56,287 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;@43da771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:10:56,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:10:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:10:56,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:56,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:10:56,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:10:56,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:10:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572124524] [2025-02-08 00:10:56,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:56,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:10:56,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:56,316 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-08 00:10:56,317 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-08 00:10:56,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:10:56,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:10:56,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:56,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:56,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 00:10:56,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:10:56,953 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-08 00:10:56,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:10:56,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:10:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572124524] [2025-02-08 00:10:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572124524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:10:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:10:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:10:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84846632] [2025-02-08 00:10:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:10:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:10:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:10:56,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:10:56,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:10:56,970 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:10:57,030 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-08 00:10:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:10:57,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 00:10:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:10:57,036 INFO L225 Difference]: With dead ends: 15 [2025-02-08 00:10:57,036 INFO L226 Difference]: Without dead ends: 8 [2025-02-08 00:10:57,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-08 00:10:57,039 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:10:57,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:10:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-08 00:10:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-08 00:10:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:10:57,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:10:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:10:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:10:57,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:10:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:10:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:10:57,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:10:57,060 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:10:57,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 00:10:57,260 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-08 00:10:57,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:10:57,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:10:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:10:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:10:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178020154] [2025-02-08 00:10:57,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:10:57,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:10:57,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:10:57,266 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-08 00:10:57,268 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-08 00:10:57,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:10:57,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:10:57,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:10:57,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:10:57,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 00:10:57,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:10:58,036 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-08 00:10:58,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:11:02,395 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-08 00:11:02,395 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:11:02,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178020154] [2025-02-08 00:11:02,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178020154] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:11:02,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:11:02,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 00:11:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088442454] [2025-02-08 00:11:02,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:11:02,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:11:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:11:02,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:11:02,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-02-08 00:11:02,397 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-08 00:11:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:02,559 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-08 00:11:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:11:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 7 [2025-02-08 00:11:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:02,560 INFO L225 Difference]: With dead ends: 13 [2025-02-08 00:11:02,560 INFO L226 Difference]: Without dead ends: 11 [2025-02-08 00:11:02,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2025-02-08 00:11:02,561 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:02,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-08 00:11:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-08 00:11:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-08 00:11:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-08 00:11:02,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-08 00:11:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:02,563 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-08 00:11:02,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-08 00:11:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-08 00:11:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 00:11:02,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:02,564 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-08 00:11:02,573 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-08 00:11:02,764 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-08 00:11:02,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:02,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-08 00:11:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:11:02,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315390412] [2025-02-08 00:11:02,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:11:02,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:02,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:02,769 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-08 00:11:02,771 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-08 00:11:03,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 00:11:03,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:11:03,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:11:03,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:03,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-08 00:11:03,591 INFO L279 TraceCheckSpWp]: Computing forward predicates...