./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:32:19,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:32:19,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:32:19,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:32:19,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:32:19,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:32:19,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:32:19,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:32:19,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:32:19,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:32:19,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:32:19,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:32:19,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:32:19,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:32:19,865 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:32:19,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:32:19,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:32:19,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:32:19,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:32:19,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:32:19,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:32:19,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:32:19,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:32:19,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:32:19,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:32:19,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:32:19,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:32:19,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:32:19,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:32:19,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:19,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:32:19,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:32:19,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:32:19,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:32:19,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:32:19,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:32:19,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:32:19,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:32:19,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:32:19,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:32:19,868 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e [2025-03-03 18:32:20,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:32:20,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:32:20,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:32:20,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:32:20,095 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:32:20,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-03 18:32:21,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bfc750ca/5ce7a29f70624483822c6686354df4dc/FLAG5b231daab [2025-03-03 18:32:21,561 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:32:21,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-03 18:32:21,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bfc750ca/5ce7a29f70624483822c6686354df4dc/FLAG5b231daab [2025-03-03 18:32:21,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bfc750ca/5ce7a29f70624483822c6686354df4dc [2025-03-03 18:32:21,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:32:21,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:32:21,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:21,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:32:21,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:32:21,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:21" (1/1) ... [2025-03-03 18:32:21,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796055cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:21, skipping insertion in model container [2025-03-03 18:32:21,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:21" (1/1) ... [2025-03-03 18:32:21,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:32:21,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-03-03 18:32:22,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:22,162 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:32:22,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-03-03 18:32:22,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:22,260 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:32:22,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22 WrapperNode [2025-03-03 18:32:22,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:22,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:22,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:32:22,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:32:22,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,547 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2601 [2025-03-03 18:32:22,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:22,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:32:22,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:32:22,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:32:22,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,684 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:32:22,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:32:22,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:32:22,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:32:22,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:32:22,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (1/1) ... [2025-03-03 18:32:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:22,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:22,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:32:22,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:32:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:32:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:32:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:32:22,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:32:23,172 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:32:23,174 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:32:25,080 INFO L? ?]: Removed 1628 outVars from TransFormulas that were not future-live. [2025-03-03 18:32:25,080 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:32:25,172 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:32:25,174 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:32:25,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:25 BoogieIcfgContainer [2025-03-03 18:32:25,175 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:32:25,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:32:25,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:32:25,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:32:25,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:32:21" (1/3) ... [2025-03-03 18:32:25,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10589ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:25, skipping insertion in model container [2025-03-03 18:32:25,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:22" (2/3) ... [2025-03-03 18:32:25,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10589ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:25, skipping insertion in model container [2025-03-03 18:32:25,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:25" (3/3) ... [2025-03-03 18:32:25,182 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-03 18:32:25,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:32:25,196 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c that has 1 procedures, 683 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:32:25,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:32:25,262 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;@417555e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:32:25,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:32:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 683 states, 681 states have (on average 1.499265785609398) internal successors, (1021), 682 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 18:32:25,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:25,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:25,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:25,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1007222086, now seen corresponding path program 1 times [2025-03-03 18:32:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887716164] [2025-03-03 18:32:25,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:25,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 18:32:25,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 18:32:25,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:25,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:26,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:26,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887716164] [2025-03-03 18:32:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887716164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:26,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:26,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909039026] [2025-03-03 18:32:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:26,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:26,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:26,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:26,246 INFO L87 Difference]: Start difference. First operand has 683 states, 681 states have (on average 1.499265785609398) internal successors, (1021), 682 states have internal predecessors, (1021), 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 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:26,663 INFO L93 Difference]: Finished difference Result 1311 states and 1963 transitions. [2025-03-03 18:32:26,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:26,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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 121 [2025-03-03 18:32:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:26,676 INFO L225 Difference]: With dead ends: 1311 [2025-03-03 18:32:26,676 INFO L226 Difference]: Without dead ends: 682 [2025-03-03 18:32:26,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:26,682 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 0 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:26,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2536 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-03 18:32:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-03-03 18:32:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.4963289280469898) internal successors, (1019), 681 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1019 transitions. [2025-03-03 18:32:26,742 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1019 transitions. Word has length 121 [2025-03-03 18:32:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:26,744 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1019 transitions. [2025-03-03 18:32:26,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:26,745 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1019 transitions. [2025-03-03 18:32:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 18:32:26,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:26,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:26,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:32:26,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:26,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1163793511, now seen corresponding path program 1 times [2025-03-03 18:32:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162688997] [2025-03-03 18:32:26,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:26,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 18:32:26,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 18:32:26,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:26,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162688997] [2025-03-03 18:32:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162688997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:27,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:27,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361615802] [2025-03-03 18:32:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:27,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:27,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:27,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:27,119 INFO L87 Difference]: Start difference. First operand 682 states and 1019 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:27,423 INFO L93 Difference]: Finished difference Result 1312 states and 1961 transitions. [2025-03-03 18:32:27,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:27,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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 122 [2025-03-03 18:32:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:27,428 INFO L225 Difference]: With dead ends: 1312 [2025-03-03 18:32:27,428 INFO L226 Difference]: Without dead ends: 684 [2025-03-03 18:32:27,429 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-03-03 18:32:27,429 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 0 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:27,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2533 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-03 18:32:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-03-03 18:32:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.4948755490483163) internal successors, (1021), 683 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1021 transitions. [2025-03-03 18:32:27,450 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1021 transitions. Word has length 122 [2025-03-03 18:32:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:27,450 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1021 transitions. [2025-03-03 18:32:27,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1021 transitions. [2025-03-03 18:32:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 18:32:27,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:27,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:27,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:32:27,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:27,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash -645596831, now seen corresponding path program 1 times [2025-03-03 18:32:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20569871] [2025-03-03 18:32:27,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:27,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 18:32:27,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 18:32:27,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:27,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:28,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20569871] [2025-03-03 18:32:28,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20569871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:28,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:28,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037263756] [2025-03-03 18:32:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:28,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:28,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:28,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:28,304 INFO L87 Difference]: Start difference. First operand 684 states and 1021 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:28,731 INFO L93 Difference]: Finished difference Result 1454 states and 2172 transitions. [2025-03-03 18:32:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:28,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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 123 [2025-03-03 18:32:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:28,736 INFO L225 Difference]: With dead ends: 1454 [2025-03-03 18:32:28,737 INFO L226 Difference]: Without dead ends: 824 [2025-03-03 18:32:28,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:28,739 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 137 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:28,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 3538 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-03-03 18:32:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 821. [2025-03-03 18:32:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 1.4939024390243902) internal successors, (1225), 820 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1225 transitions. [2025-03-03 18:32:28,757 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1225 transitions. Word has length 123 [2025-03-03 18:32:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:28,757 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1225 transitions. [2025-03-03 18:32:28,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1225 transitions. [2025-03-03 18:32:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 18:32:28,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:28,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:28,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:32:28,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:28,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash -945269300, now seen corresponding path program 1 times [2025-03-03 18:32:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:28,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783748568] [2025-03-03 18:32:28,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 18:32:28,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 18:32:28,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:28,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783748568] [2025-03-03 18:32:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783748568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:29,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469713418] [2025-03-03 18:32:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:29,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:29,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:29,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:29,284 INFO L87 Difference]: Start difference. First operand 821 states and 1225 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:29,820 INFO L93 Difference]: Finished difference Result 1596 states and 2382 transitions. [2025-03-03 18:32:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:32:29,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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 124 [2025-03-03 18:32:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:29,824 INFO L225 Difference]: With dead ends: 1596 [2025-03-03 18:32:29,825 INFO L226 Difference]: Without dead ends: 829 [2025-03-03 18:32:29,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:29,829 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 137 mSDsluCounter, 4197 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:29,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 5039 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:32:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-03 18:32:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 828. [2025-03-03 18:32:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.4933494558645708) internal successors, (1235), 827 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1235 transitions. [2025-03-03 18:32:29,846 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1235 transitions. Word has length 124 [2025-03-03 18:32:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:29,847 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1235 transitions. [2025-03-03 18:32:29,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1235 transitions. [2025-03-03 18:32:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 18:32:29,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:29,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:29,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:32:29,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:29,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1579365723, now seen corresponding path program 1 times [2025-03-03 18:32:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533750843] [2025-03-03 18:32:29,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:29,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:29,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 18:32:29,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 18:32:29,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:29,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533750843] [2025-03-03 18:32:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533750843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:30,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073135081] [2025-03-03 18:32:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:30,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:30,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:30,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:30,116 INFO L87 Difference]: Start difference. First operand 828 states and 1235 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:30,444 INFO L93 Difference]: Finished difference Result 1620 states and 2417 transitions. [2025-03-03 18:32:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 124 [2025-03-03 18:32:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:30,447 INFO L225 Difference]: With dead ends: 1620 [2025-03-03 18:32:30,447 INFO L226 Difference]: Without dead ends: 846 [2025-03-03 18:32:30,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:30,449 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 16 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:30,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3374 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-03 18:32:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2025-03-03 18:32:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4923076923076923) internal successors, (1261), 845 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1261 transitions. [2025-03-03 18:32:30,465 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1261 transitions. Word has length 124 [2025-03-03 18:32:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:30,466 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1261 transitions. [2025-03-03 18:32:30,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1261 transitions. [2025-03-03 18:32:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 18:32:30,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:30,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:30,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:32:30,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:30,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -367199608, now seen corresponding path program 1 times [2025-03-03 18:32:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760462575] [2025-03-03 18:32:30,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:30,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:30,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 18:32:30,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 18:32:30,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:30,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:30,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:30,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760462575] [2025-03-03 18:32:30,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760462575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:30,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:30,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688338172] [2025-03-03 18:32:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:30,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:30,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:30,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:30,937 INFO L87 Difference]: Start difference. First operand 846 states and 1261 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:31,386 INFO L93 Difference]: Finished difference Result 1640 states and 2445 transitions. [2025-03-03 18:32:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:31,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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 125 [2025-03-03 18:32:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:31,389 INFO L225 Difference]: With dead ends: 1640 [2025-03-03 18:32:31,389 INFO L226 Difference]: Without dead ends: 848 [2025-03-03 18:32:31,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:31,391 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 987 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:31,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 3332 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-03-03 18:32:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-03-03 18:32:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.4911452184179457) internal successors, (1263), 847 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1263 transitions. [2025-03-03 18:32:31,407 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1263 transitions. Word has length 125 [2025-03-03 18:32:31,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:31,407 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1263 transitions. [2025-03-03 18:32:31,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:31,408 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1263 transitions. [2025-03-03 18:32:31,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 18:32:31,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:31,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:32:31,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -849865950, now seen corresponding path program 1 times [2025-03-03 18:32:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430191484] [2025-03-03 18:32:31,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:31,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 18:32:31,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 18:32:31,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:31,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430191484] [2025-03-03 18:32:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430191484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:31,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:31,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357081778] [2025-03-03 18:32:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:31,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:31,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:31,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:31,645 INFO L87 Difference]: Start difference. First operand 848 states and 1263 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:31,958 INFO L93 Difference]: Finished difference Result 1654 states and 2464 transitions. [2025-03-03 18:32:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:31,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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 126 [2025-03-03 18:32:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:31,961 INFO L225 Difference]: With dead ends: 1654 [2025-03-03 18:32:31,961 INFO L226 Difference]: Without dead ends: 860 [2025-03-03 18:32:31,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:31,963 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 4 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:31,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3374 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-03 18:32:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2025-03-03 18:32:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 1.4889406286379512) internal successors, (1279), 859 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1279 transitions. [2025-03-03 18:32:32,001 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1279 transitions. Word has length 126 [2025-03-03 18:32:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:32,001 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1279 transitions. [2025-03-03 18:32:32,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1279 transitions. [2025-03-03 18:32:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 18:32:32,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:32,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:32,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:32:32,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:32,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash 750801056, now seen corresponding path program 1 times [2025-03-03 18:32:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:32,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586754400] [2025-03-03 18:32:32,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:32,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 18:32:32,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 18:32:32,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:32,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:32,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586754400] [2025-03-03 18:32:32,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586754400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:32,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:32,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044389976] [2025-03-03 18:32:32,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:32,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:32,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:32,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:32,427 INFO L87 Difference]: Start difference. First operand 860 states and 1279 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:32,916 INFO L93 Difference]: Finished difference Result 2009 states and 2983 transitions. [2025-03-03 18:32:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:32,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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 126 [2025-03-03 18:32:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:32,920 INFO L225 Difference]: With dead ends: 2009 [2025-03-03 18:32:32,920 INFO L226 Difference]: Without dead ends: 1203 [2025-03-03 18:32:32,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:32,922 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 1953 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 3331 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:32,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 3331 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-03-03 18:32:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 864. [2025-03-03 18:32:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 1.488991888760139) internal successors, (1285), 863 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1285 transitions. [2025-03-03 18:32:32,939 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1285 transitions. Word has length 126 [2025-03-03 18:32:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:32,939 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1285 transitions. [2025-03-03 18:32:32,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1285 transitions. [2025-03-03 18:32:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:32:32,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:32,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:32,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:32:32,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:32,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash -695445112, now seen corresponding path program 1 times [2025-03-03 18:32:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247106464] [2025-03-03 18:32:32,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:32,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:32:33,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:32:33,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:33,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247106464] [2025-03-03 18:32:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247106464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255768349] [2025-03-03 18:32:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:33,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:33,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:33,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:33,243 INFO L87 Difference]: Start difference. First operand 864 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:33,578 INFO L93 Difference]: Finished difference Result 1710 states and 2544 transitions. [2025-03-03 18:32:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 127 [2025-03-03 18:32:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:33,582 INFO L225 Difference]: With dead ends: 1710 [2025-03-03 18:32:33,582 INFO L226 Difference]: Without dead ends: 900 [2025-03-03 18:32:33,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:33,583 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 16 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:33,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3374 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-03 18:32:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2025-03-03 18:32:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.4872080088987765) internal successors, (1337), 899 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1337 transitions. [2025-03-03 18:32:33,601 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1337 transitions. Word has length 127 [2025-03-03 18:32:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:33,602 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1337 transitions. [2025-03-03 18:32:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1337 transitions. [2025-03-03 18:32:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:32:33,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:33,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:33,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:32:33,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:33,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash 975055299, now seen corresponding path program 1 times [2025-03-03 18:32:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457962520] [2025-03-03 18:32:33,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:33,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:32:33,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:32:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:33,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:33,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457962520] [2025-03-03 18:32:33,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457962520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:33,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:33,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940882561] [2025-03-03 18:32:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:33,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:33,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:33,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:33,888 INFO L87 Difference]: Start difference. First operand 900 states and 1337 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:34,417 INFO L93 Difference]: Finished difference Result 2244 states and 3329 transitions. [2025-03-03 18:32:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:34,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 127 [2025-03-03 18:32:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:34,422 INFO L225 Difference]: With dead ends: 2244 [2025-03-03 18:32:34,422 INFO L226 Difference]: Without dead ends: 1398 [2025-03-03 18:32:34,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:34,424 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 466 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:34,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 3169 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:32:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-03 18:32:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 903. [2025-03-03 18:32:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 1.4866962305986697) internal successors, (1341), 902 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1341 transitions. [2025-03-03 18:32:34,443 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1341 transitions. Word has length 127 [2025-03-03 18:32:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:34,443 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1341 transitions. [2025-03-03 18:32:34,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1341 transitions. [2025-03-03 18:32:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 18:32:34,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:34,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:34,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:32:34,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:34,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:34,445 INFO L85 PathProgramCache]: Analyzing trace with hash 503318683, now seen corresponding path program 1 times [2025-03-03 18:32:34,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:34,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271762804] [2025-03-03 18:32:34,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:34,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:34,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 18:32:34,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 18:32:34,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:34,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271762804] [2025-03-03 18:32:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271762804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175000247] [2025-03-03 18:32:34,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:34,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:34,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:34,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:34,702 INFO L87 Difference]: Start difference. First operand 903 states and 1341 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:35,076 INFO L93 Difference]: Finished difference Result 1761 states and 2616 transitions. [2025-03-03 18:32:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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 128 [2025-03-03 18:32:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:35,079 INFO L225 Difference]: With dead ends: 1761 [2025-03-03 18:32:35,079 INFO L226 Difference]: Without dead ends: 915 [2025-03-03 18:32:35,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:35,081 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 4 mSDsluCounter, 3369 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:35,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4215 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-03 18:32:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2025-03-03 18:32:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.4846827133479212) internal successors, (1357), 914 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1357 transitions. [2025-03-03 18:32:35,096 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1357 transitions. Word has length 128 [2025-03-03 18:32:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:35,096 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1357 transitions. [2025-03-03 18:32:35,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1357 transitions. [2025-03-03 18:32:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 18:32:35,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:35,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:35,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:32:35,098 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:35,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:35,098 INFO L85 PathProgramCache]: Analyzing trace with hash -41213545, now seen corresponding path program 1 times [2025-03-03 18:32:35,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:35,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150778477] [2025-03-03 18:32:35,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:35,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 18:32:35,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 18:32:35,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:35,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:35,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:35,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150778477] [2025-03-03 18:32:35,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150778477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:35,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:35,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616799113] [2025-03-03 18:32:35,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:35,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:35,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:35,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:35,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:35,496 INFO L87 Difference]: Start difference. First operand 915 states and 1357 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:35,956 INFO L93 Difference]: Finished difference Result 2082 states and 3082 transitions. [2025-03-03 18:32:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:35,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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 128 [2025-03-03 18:32:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:35,960 INFO L225 Difference]: With dead ends: 2082 [2025-03-03 18:32:35,961 INFO L226 Difference]: Without dead ends: 1223 [2025-03-03 18:32:35,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:35,962 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 454 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:35,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3270 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-03-03 18:32:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 914. [2025-03-03 18:32:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 1.484118291347207) internal successors, (1355), 913 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1355 transitions. [2025-03-03 18:32:35,980 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1355 transitions. Word has length 128 [2025-03-03 18:32:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:35,981 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1355 transitions. [2025-03-03 18:32:35,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1355 transitions. [2025-03-03 18:32:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 18:32:35,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:35,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:35,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:32:35,982 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:35,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:35,983 INFO L85 PathProgramCache]: Analyzing trace with hash 936223134, now seen corresponding path program 1 times [2025-03-03 18:32:35,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:35,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436841304] [2025-03-03 18:32:35,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:35,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:36,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:32:36,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:32:36,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:36,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436841304] [2025-03-03 18:32:36,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436841304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:36,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:36,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660797516] [2025-03-03 18:32:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:36,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:36,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:36,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:36,208 INFO L87 Difference]: Start difference. First operand 914 states and 1355 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:36,581 INFO L93 Difference]: Finished difference Result 1808 states and 2682 transitions. [2025-03-03 18:32:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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 129 [2025-03-03 18:32:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:36,584 INFO L225 Difference]: With dead ends: 1808 [2025-03-03 18:32:36,584 INFO L226 Difference]: Without dead ends: 950 [2025-03-03 18:32:36,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:36,586 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 16 mSDsluCounter, 3369 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:36,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4215 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-03-03 18:32:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2025-03-03 18:32:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 1.4826132771338252) internal successors, (1407), 949 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1407 transitions. [2025-03-03 18:32:36,601 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1407 transitions. Word has length 129 [2025-03-03 18:32:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:36,602 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1407 transitions. [2025-03-03 18:32:36,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1407 transitions. [2025-03-03 18:32:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 18:32:36,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:36,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:36,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:32:36,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:36,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 960741300, now seen corresponding path program 1 times [2025-03-03 18:32:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109325346] [2025-03-03 18:32:36,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:36,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 18:32:36,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 18:32:36,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:36,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:36,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:36,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109325346] [2025-03-03 18:32:36,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109325346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:36,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:36,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150634777] [2025-03-03 18:32:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:36,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:36,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:36,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:36,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:36,815 INFO L87 Difference]: Start difference. First operand 950 states and 1407 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:37,153 INFO L93 Difference]: Finished difference Result 1856 states and 2750 transitions. [2025-03-03 18:32:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:37,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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 130 [2025-03-03 18:32:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:37,156 INFO L225 Difference]: With dead ends: 1856 [2025-03-03 18:32:37,157 INFO L226 Difference]: Without dead ends: 962 [2025-03-03 18:32:37,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:37,158 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 4 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:37,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3374 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-03 18:32:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2025-03-03 18:32:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.4807492195629552) internal successors, (1423), 961 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1423 transitions. [2025-03-03 18:32:37,172 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1423 transitions. Word has length 130 [2025-03-03 18:32:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:37,173 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1423 transitions. [2025-03-03 18:32:37,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1423 transitions. [2025-03-03 18:32:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 18:32:37,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:37,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:32:37,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1085709844, now seen corresponding path program 1 times [2025-03-03 18:32:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:37,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197025204] [2025-03-03 18:32:37,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:37,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 18:32:37,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 18:32:37,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:37,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:37,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197025204] [2025-03-03 18:32:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197025204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:37,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:37,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:37,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859544665] [2025-03-03 18:32:37,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:37,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:37,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:37,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:37,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:37,395 INFO L87 Difference]: Start difference. First operand 962 states and 1423 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:37,803 INFO L93 Difference]: Finished difference Result 1904 states and 2818 transitions. [2025-03-03 18:32:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:37,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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 131 [2025-03-03 18:32:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:37,806 INFO L225 Difference]: With dead ends: 1904 [2025-03-03 18:32:37,806 INFO L226 Difference]: Without dead ends: 998 [2025-03-03 18:32:37,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:37,809 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 16 mSDsluCounter, 3369 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:37,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4215 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-03 18:32:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2025-03-03 18:32:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.4794383149448345) internal successors, (1475), 997 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1475 transitions. [2025-03-03 18:32:37,827 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1475 transitions. Word has length 131 [2025-03-03 18:32:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:37,827 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1475 transitions. [2025-03-03 18:32:37,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1475 transitions. [2025-03-03 18:32:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 18:32:37,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:37,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:37,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:32:37,829 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:37,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1140486035, now seen corresponding path program 1 times [2025-03-03 18:32:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:37,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612032964] [2025-03-03 18:32:37,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:37,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 18:32:37,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 18:32:37,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:37,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:38,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612032964] [2025-03-03 18:32:38,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612032964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:38,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:38,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:38,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289409109] [2025-03-03 18:32:38,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:38,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:38,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:38,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:38,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:38,078 INFO L87 Difference]: Start difference. First operand 998 states and 1475 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:38,413 INFO L93 Difference]: Finished difference Result 1952 states and 2886 transitions. [2025-03-03 18:32:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:38,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 132 [2025-03-03 18:32:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:38,417 INFO L225 Difference]: With dead ends: 1952 [2025-03-03 18:32:38,417 INFO L226 Difference]: Without dead ends: 1010 [2025-03-03 18:32:38,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:38,419 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 4 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:38,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3374 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-03 18:32:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2025-03-03 18:32:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 1.4777006937561943) internal successors, (1491), 1009 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1491 transitions. [2025-03-03 18:32:38,436 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1491 transitions. Word has length 132 [2025-03-03 18:32:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:38,436 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1491 transitions. [2025-03-03 18:32:38,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1491 transitions. [2025-03-03 18:32:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 18:32:38,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:38,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:38,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:32:38,438 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:38,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash -974391574, now seen corresponding path program 1 times [2025-03-03 18:32:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:38,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200970682] [2025-03-03 18:32:38,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:38,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 18:32:38,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 18:32:38,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:38,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200970682] [2025-03-03 18:32:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200970682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:38,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:38,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463939883] [2025-03-03 18:32:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:38,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:38,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:38,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:38,660 INFO L87 Difference]: Start difference. First operand 1010 states and 1491 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:38,960 INFO L93 Difference]: Finished difference Result 2000 states and 2954 transitions. [2025-03-03 18:32:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:38,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 133 [2025-03-03 18:32:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:38,964 INFO L225 Difference]: With dead ends: 2000 [2025-03-03 18:32:38,964 INFO L226 Difference]: Without dead ends: 1046 [2025-03-03 18:32:38,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:38,965 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 16 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:38,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3374 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-03 18:32:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-03-03 18:32:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 1.476555023923445) internal successors, (1543), 1045 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1543 transitions. [2025-03-03 18:32:38,978 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1543 transitions. Word has length 133 [2025-03-03 18:32:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1543 transitions. [2025-03-03 18:32:38,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1543 transitions. [2025-03-03 18:32:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 18:32:38,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:38,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:32:38,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash -210644282, now seen corresponding path program 1 times [2025-03-03 18:32:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444596117] [2025-03-03 18:32:38,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:39,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 18:32:39,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 18:32:39,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:39,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:41,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:41,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444596117] [2025-03-03 18:32:41,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444596117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:41,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:41,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2025-03-03 18:32:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128279625] [2025-03-03 18:32:41,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:41,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 18:32:41,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:41,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 18:32:41,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 18:32:41,025 INFO L87 Difference]: Start difference. First operand 1046 states and 1543 transitions. Second operand has 39 states, 39 states have (on average 3.4358974358974357) internal successors, (134), 39 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:45,041 INFO L93 Difference]: Finished difference Result 2166 states and 3198 transitions. [2025-03-03 18:32:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 18:32:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4358974358974357) internal successors, (134), 39 states have internal predecessors, (134), 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 134 [2025-03-03 18:32:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:45,044 INFO L225 Difference]: With dead ends: 2166 [2025-03-03 18:32:45,045 INFO L226 Difference]: Without dead ends: 1176 [2025-03-03 18:32:45,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=267, Invalid=4563, Unknown=0, NotChecked=0, Total=4830 [2025-03-03 18:32:45,048 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 1455 mSDsluCounter, 27215 mSDsCounter, 0 mSdLazyCounter, 8618 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 27993 SdHoareTripleChecker+Invalid, 8647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:45,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 27993 Invalid, 8647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 8618 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 18:32:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-03 18:32:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1173. [2025-03-03 18:32:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.4786689419795223) internal successors, (1733), 1172 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1733 transitions. [2025-03-03 18:32:45,064 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1733 transitions. Word has length 134 [2025-03-03 18:32:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:45,064 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1733 transitions. [2025-03-03 18:32:45,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4358974358974357) internal successors, (134), 39 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1733 transitions. [2025-03-03 18:32:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 18:32:45,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:45,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:45,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 18:32:45,066 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:45,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:45,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1880899703, now seen corresponding path program 1 times [2025-03-03 18:32:45,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:45,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786159380] [2025-03-03 18:32:45,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:45,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:45,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 18:32:45,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 18:32:45,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786159380] [2025-03-03 18:32:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786159380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:45,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:45,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652986926] [2025-03-03 18:32:45,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:45,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:45,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:45,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:45,828 INFO L87 Difference]: Start difference. First operand 1173 states and 1733 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:46,249 INFO L93 Difference]: Finished difference Result 2304 states and 3406 transitions. [2025-03-03 18:32:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:32:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 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 135 [2025-03-03 18:32:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:46,252 INFO L225 Difference]: With dead ends: 2304 [2025-03-03 18:32:46,252 INFO L226 Difference]: Without dead ends: 1187 [2025-03-03 18:32:46,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:32:46,254 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 990 mSDsluCounter, 3346 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 4188 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:46,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 4188 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-03-03 18:32:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1185. [2025-03-03 18:32:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4755067567567568) internal successors, (1747), 1184 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1747 transitions. [2025-03-03 18:32:46,272 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1747 transitions. Word has length 135 [2025-03-03 18:32:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:46,273 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1747 transitions. [2025-03-03 18:32:46,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1747 transitions. [2025-03-03 18:32:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 18:32:46,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:46,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:46,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:32:46,275 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2057680344, now seen corresponding path program 1 times [2025-03-03 18:32:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47016715] [2025-03-03 18:32:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:46,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 18:32:46,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 18:32:46,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:46,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:32:46,487 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:32:46,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 18:32:46,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 18:32:46,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:46,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:32:46,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:32:46,682 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:32:46,682 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:32:46,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 18:32:46,685 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-03-03 18:32:46,750 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:32:46,772 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:32:46,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:32:46 BoogieIcfgContainer [2025-03-03 18:32:46,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:32:46,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:32:46,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:32:46,775 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:32:46,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:25" (3/4) ... [2025-03-03 18:32:46,777 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:32:46,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:32:46,779 INFO L158 Benchmark]: Toolchain (without parser) took 24956.43ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 122.2MB in the beginning and 554.0MB in the end (delta: -431.8MB). Peak memory consumption was 408.3MB. Max. memory is 16.1GB. [2025-03-03 18:32:46,779 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:32:46,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.71ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 69.8MB in the end (delta: 52.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 18:32:46,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 286.03ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 69.8MB in the beginning and 102.7MB in the end (delta: -32.9MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2025-03-03 18:32:46,780 INFO L158 Benchmark]: Boogie Preprocessor took 312.20ms. Allocated memory is still 176.2MB. Free memory was 102.7MB in the beginning and 70.8MB in the end (delta: 31.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 18:32:46,780 INFO L158 Benchmark]: IcfgBuilder took 2313.81ms. Allocated memory was 176.2MB in the beginning and 478.2MB in the end (delta: 302.0MB). Free memory was 70.8MB in the beginning and 321.0MB in the end (delta: -250.1MB). Peak memory consumption was 216.9MB. Max. memory is 16.1GB. [2025-03-03 18:32:46,780 INFO L158 Benchmark]: TraceAbstraction took 21597.85ms. Allocated memory was 478.2MB in the beginning and 1.0GB in the end (delta: 528.5MB). Free memory was 321.0MB in the beginning and 554.1MB in the end (delta: -233.1MB). Peak memory consumption was 299.3MB. Max. memory is 16.1GB. [2025-03-03 18:32:46,780 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 1.0GB. Free memory was 554.1MB in the beginning and 554.0MB in the end (delta: 73.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:32:46,781 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.13ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.71ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 69.8MB in the end (delta: 52.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 286.03ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 69.8MB in the beginning and 102.7MB in the end (delta: -32.9MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 312.20ms. Allocated memory is still 176.2MB. Free memory was 102.7MB in the beginning and 70.8MB in the end (delta: 31.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2313.81ms. Allocated memory was 176.2MB in the beginning and 478.2MB in the end (delta: 302.0MB). Free memory was 70.8MB in the beginning and 321.0MB in the end (delta: -250.1MB). Peak memory consumption was 216.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21597.85ms. Allocated memory was 478.2MB in the beginning and 1.0GB in the end (delta: 528.5MB). Free memory was 321.0MB in the beginning and 554.1MB in the end (delta: -233.1MB). Peak memory consumption was 299.3MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 1.0GB. Free memory was 554.1MB in the beginning and 554.0MB in the end (delta: 73.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 353, overapproximation of bitwiseAnd at line 358. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_24 mask_SORT_24 = (SORT_24)-1 >> (sizeof(SORT_24) * 8 - 2); [L39] const SORT_24 msb_SORT_24 = (SORT_24)1 << (2 - 1); [L41] const SORT_156 mask_SORT_156 = (SORT_156)-1 >> (sizeof(SORT_156) * 8 - 4); [L42] const SORT_156 msb_SORT_156 = (SORT_156)1 << (4 - 1); [L44] const SORT_204 mask_SORT_204 = (SORT_204)-1 >> (sizeof(SORT_204) * 8 - 32); [L45] const SORT_204 msb_SORT_204 = (SORT_204)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 4; [L50] const SORT_10 var_18 = 0; [L51] const SORT_1 var_22 = 1; [L52] const SORT_24 var_26 = 0; [L53] const SORT_24 var_29 = 3; [L54] const SORT_3 var_34 = 0; [L55] const SORT_1 var_45 = 0; [L56] const SORT_10 var_118 = 2; [L57] const SORT_10 var_122 = 1; [L58] const SORT_10 var_128 = 5; [L59] const SORT_10 var_172 = 7; [L60] const SORT_10 var_177 = 6; [L61] const SORT_204 var_206 = 0; [L62] const SORT_3 var_221 = 2; [L63] const SORT_3 var_243 = 31; [L65] SORT_1 input_2; [L66] SORT_3 input_4; [L67] SORT_5 input_6; [L68] SORT_3 input_232; [L69] SORT_3 input_233; [L70] SORT_3 input_234; [L71] SORT_3 input_242; [L72] SORT_3 input_252; [L73] SORT_3 input_253; [L74] SORT_3 input_254; [L75] SORT_3 input_257; [L76] SORT_3 input_276; [L77] SORT_3 input_277; [L78] SORT_3 input_278; [L79] SORT_3 input_281; [L80] SORT_3 input_283; [L81] SORT_24 input_297; [L82] SORT_24 input_298; [L83] SORT_24 input_299; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L85] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L86] SORT_10 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L87] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L88] SORT_3 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L89] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L90] SORT_1 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L91] SORT_3 state_104 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L92] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L93] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L94] SORT_3 state_110 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L95] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L96] SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L97] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L99] SORT_5 init_9_arg_1 = var_7; [L100] state_8 = init_9_arg_1 [L101] SORT_10 init_20_arg_1 = var_18; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_36_arg_1 = var_34; [L104] state_35 = init_36_arg_1 [L105] SORT_3 init_39_arg_1 = var_34; [L106] state_38 = init_39_arg_1 [L107] SORT_3 init_43_arg_1 = var_34; [L108] state_42 = init_43_arg_1 [L109] SORT_1 init_103_arg_1 = var_45; [L110] state_102 = init_103_arg_1 [L111] SORT_3 init_105_arg_1 = var_34; [L112] state_104 = init_105_arg_1 [L113] SORT_3 init_107_arg_1 = var_34; [L114] state_106 = init_107_arg_1 [L115] SORT_3 init_109_arg_1 = var_34; [L116] state_108 = init_109_arg_1 [L117] SORT_3 init_111_arg_1 = var_34; [L118] state_110 = init_111_arg_1 [L119] SORT_3 init_113_arg_1 = var_34; [L120] state_112 = init_113_arg_1 [L121] SORT_3 init_115_arg_1 = var_34; [L122] state_114 = init_115_arg_1 [L123] SORT_3 init_117_arg_1 = var_34; [L124] state_116 = init_117_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_ushort() [L130] input_232 = __VERIFIER_nondet_uchar() [L131] input_233 = __VERIFIER_nondet_uchar() [L132] input_234 = __VERIFIER_nondet_uchar() [L133] input_242 = __VERIFIER_nondet_uchar() [L134] input_252 = __VERIFIER_nondet_uchar() [L135] input_253 = __VERIFIER_nondet_uchar() [L136] input_254 = __VERIFIER_nondet_uchar() [L137] input_257 = __VERIFIER_nondet_uchar() [L138] input_276 = __VERIFIER_nondet_uchar() [L139] input_277 = __VERIFIER_nondet_uchar() [L140] input_278 = __VERIFIER_nondet_uchar() [L141] input_281 = __VERIFIER_nondet_uchar() [L142] input_283 = __VERIFIER_nondet_uchar() [L143] input_297 = __VERIFIER_nondet_uchar() [L144] input_298 = __VERIFIER_nondet_uchar() [L145] input_299 = __VERIFIER_nondet_uchar() [L148] SORT_5 var_11_arg_0 = state_8; [L149] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L150] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L150] var_11 = var_11 & mask_SORT_10 [L151] SORT_10 var_13_arg_0 = var_11; [L152] SORT_10 var_13_arg_1 = var_12; [L153] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L154] SORT_5 var_14_arg_0 = state_8; [L155] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L156] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L156] var_14 = var_14 & mask_SORT_10 [L157] SORT_10 var_16_arg_0 = var_14; [L158] SORT_10 var_16_arg_1 = var_15; [L159] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L160] SORT_1 var_17_arg_0 = var_13; [L161] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17_arg_0=0, var_17_arg_1=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L162] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L162] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L163] SORT_10 var_21_arg_0 = state_19; [L164] SORT_1 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_21=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L165] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L165] var_21 = var_21 & mask_SORT_1 [L166] SORT_1 var_23_arg_0 = var_21; [L167] SORT_1 var_23_arg_1 = var_22; [L168] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L169] SORT_10 var_25_arg_0 = state_19; [L170] SORT_24 var_25 = var_25_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_23=0, var_243=31, var_25=0, var_26=0, var_29=3, var_34=0, var_45=0] [L171] EXPR var_25 & mask_SORT_24 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_23=0, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L171] var_25 = var_25 & mask_SORT_24 [L172] SORT_24 var_27_arg_0 = var_25; [L173] SORT_24 var_27_arg_1 = var_26; [L174] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L175] SORT_1 var_28_arg_0 = var_23; [L176] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_25=0, var_26=0, var_28_arg_0=0, var_28_arg_1=1, var_29=3, var_34=0, var_45=0] [L177] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_25=0, var_26=0, var_29=3, var_34=0, var_45=0] [L177] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L178] SORT_24 var_30_arg_0 = var_25; [L179] SORT_24 var_30_arg_1 = var_29; [L180] SORT_1 var_30 = var_30_arg_0 == var_30_arg_1; [L181] SORT_1 var_31_arg_0 = var_28; [L182] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_31_arg_0=1, var_31_arg_1=0, var_34=0, var_45=0] [L183] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L183] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L184] SORT_1 var_32_arg_0 = var_17; [L185] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_32_arg_0=0, var_32_arg_1=1, var_34=0, var_45=0] [L186] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L186] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L187] SORT_1 var_33_arg_0 = var_32; [L188] SORT_1 var_33 = ~var_33_arg_0; [L189] SORT_3 var_37_arg_0 = state_35; [L190] SORT_1 var_37 = var_37_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_45=0] [L191] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L191] var_37 = var_37 & mask_SORT_1 [L192] SORT_3 var_40_arg_0 = state_38; [L193] SORT_1 var_40 = var_40_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_45=0] [L194] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_45=0] [L194] var_40 = var_40 & mask_SORT_1 [L195] SORT_1 var_41_arg_0 = var_37; [L196] SORT_1 var_41_arg_1 = var_40; [L197] SORT_1 var_41 = var_41_arg_0 != var_41_arg_1; [L198] SORT_3 var_44_arg_0 = state_42; [L199] SORT_1 var_44 = var_44_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_41=0, var_44=0, var_45=0] [L200] EXPR var_44 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_41=0, var_45=0] [L200] var_44 = var_44 & mask_SORT_1 [L201] SORT_1 var_46_arg_0 = var_44; [L202] SORT_1 var_46_arg_1 = var_45; [L203] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L204] SORT_1 var_47_arg_0 = var_41; [L205] SORT_1 var_47_arg_1 = var_46; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_44=0, var_45=0, var_47_arg_0=0, var_47_arg_1=1] [L206] EXPR var_47_arg_0 | var_47_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_44=0, var_45=0] [L206] SORT_1 var_47 = var_47_arg_0 | var_47_arg_1; [L207] SORT_1 var_48_arg_0 = var_44; [L208] SORT_1 var_48_arg_1 = var_45; [L209] SORT_1 var_48 = var_48_arg_0 != var_48_arg_1; [L210] SORT_1 var_49_arg_0 = var_37; [L211] SORT_1 var_49_arg_1 = var_40; [L212] SORT_1 var_49 = var_49_arg_0 == var_49_arg_1; [L213] SORT_1 var_50_arg_0 = var_48; [L214] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_47=1, var_50_arg_0=0, var_50_arg_1=1] [L215] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_47=1] [L215] SORT_1 var_50 = var_50_arg_0 | var_50_arg_1; [L216] SORT_1 var_51_arg_0 = var_47; [L217] SORT_1 var_51_arg_1 = var_50; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51_arg_0=1, var_51_arg_1=1] [L218] EXPR var_51_arg_0 & var_51_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L218] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L219] SORT_3 var_52_arg_0 = state_35; [L220] SORT_1 var_52 = var_52_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0] [L221] EXPR var_52 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1] [L221] var_52 = var_52 & mask_SORT_1 [L222] SORT_3 var_53_arg_0 = state_38; [L223] SORT_1 var_53 = var_53_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0] [L224] EXPR var_53 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0] [L224] var_53 = var_53 & mask_SORT_1 [L225] SORT_1 var_54_arg_0 = var_52; [L226] SORT_1 var_54_arg_1 = var_53; [L227] SORT_1 var_54 = var_54_arg_0 != var_54_arg_1; [L228] SORT_3 var_55_arg_0 = state_42; [L229] SORT_1 var_55 = var_55_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_54=0, var_55=0] [L230] EXPR var_55 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_54=0] [L230] var_55 = var_55 & mask_SORT_1 [L231] SORT_1 var_56_arg_0 = var_55; [L232] SORT_1 var_56_arg_1 = var_45; [L233] SORT_1 var_56 = var_56_arg_0 == var_56_arg_1; [L234] SORT_1 var_57_arg_0 = var_54; [L235] SORT_1 var_57_arg_1 = var_56; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_55=0, var_57_arg_0=0, var_57_arg_1=1] [L236] EXPR var_57_arg_0 | var_57_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_55=0] [L236] SORT_1 var_57 = var_57_arg_0 | var_57_arg_1; [L237] SORT_1 var_58_arg_0 = var_51; [L238] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_52=0, var_53=0, var_55=0, var_58_arg_0=1, var_58_arg_1=1] [L239] EXPR var_58_arg_0 & var_58_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_52=0, var_53=0, var_55=0] [L239] SORT_1 var_58 = var_58_arg_0 & var_58_arg_1; [L240] SORT_1 var_59_arg_0 = var_55; [L241] SORT_1 var_59_arg_1 = var_45; [L242] SORT_1 var_59 = var_59_arg_0 != var_59_arg_1; [L243] SORT_1 var_60_arg_0 = var_52; [L244] SORT_1 var_60_arg_1 = var_53; [L245] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L246] SORT_1 var_61_arg_0 = var_59; [L247] SORT_1 var_61_arg_1 = var_60; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_58=1, var_61_arg_0=0, var_61_arg_1=1] [L248] EXPR var_61_arg_0 | var_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_58=1] [L248] SORT_1 var_61 = var_61_arg_0 | var_61_arg_1; [L249] SORT_1 var_62_arg_0 = var_58; [L250] SORT_1 var_62_arg_1 = var_61; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62_arg_0=1, var_62_arg_1=1] [L251] EXPR var_62_arg_0 & var_62_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L251] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L252] SORT_3 var_63_arg_0 = state_35; [L253] SORT_1 var_63 = var_63_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0] [L254] EXPR var_63 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1] [L254] var_63 = var_63 & mask_SORT_1 [L255] SORT_3 var_64_arg_0 = state_38; [L256] SORT_1 var_64 = var_64_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0] [L257] EXPR var_64 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0] [L257] var_64 = var_64 & mask_SORT_1 [L258] SORT_1 var_65_arg_0 = var_63; [L259] SORT_1 var_65_arg_1 = var_64; [L260] SORT_1 var_65 = var_65_arg_0 != var_65_arg_1; [L261] SORT_3 var_66_arg_0 = state_42; [L262] SORT_1 var_66 = var_66_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_65=0, var_66=0] [L263] EXPR var_66 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_65=0] [L263] var_66 = var_66 & mask_SORT_1 [L264] SORT_1 var_67_arg_0 = var_66; [L265] SORT_1 var_67_arg_1 = var_45; [L266] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L267] SORT_1 var_68_arg_0 = var_65; [L268] SORT_1 var_68_arg_1 = var_67; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_66=0, var_68_arg_0=0, var_68_arg_1=1] [L269] EXPR var_68_arg_0 | var_68_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_66=0] [L269] SORT_1 var_68 = var_68_arg_0 | var_68_arg_1; [L270] SORT_1 var_69_arg_0 = var_62; [L271] SORT_1 var_69_arg_1 = var_68; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_63=0, var_64=0, var_66=0, var_69_arg_0=1, var_69_arg_1=1] [L272] EXPR var_69_arg_0 & var_69_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_63=0, var_64=0, var_66=0] [L272] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L273] SORT_1 var_70_arg_0 = var_66; [L274] SORT_1 var_70_arg_1 = var_45; [L275] SORT_1 var_70 = var_70_arg_0 != var_70_arg_1; [L276] SORT_1 var_71_arg_0 = var_63; [L277] SORT_1 var_71_arg_1 = var_64; [L278] SORT_1 var_71 = var_71_arg_0 == var_71_arg_1; [L279] SORT_1 var_72_arg_0 = var_70; [L280] SORT_1 var_72_arg_1 = var_71; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_69=1, var_72_arg_0=0, var_72_arg_1=1] [L281] EXPR var_72_arg_0 | var_72_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_69=1] [L281] SORT_1 var_72 = var_72_arg_0 | var_72_arg_1; [L282] SORT_1 var_73_arg_0 = var_69; [L283] SORT_1 var_73_arg_1 = var_72; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73_arg_0=1, var_73_arg_1=1] [L284] EXPR var_73_arg_0 & var_73_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L284] SORT_1 var_73 = var_73_arg_0 & var_73_arg_1; [L285] SORT_3 var_74_arg_0 = state_35; [L286] SORT_1 var_74 = var_74_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0] [L287] EXPR var_74 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1] [L287] var_74 = var_74 & mask_SORT_1 [L288] SORT_3 var_75_arg_0 = state_38; [L289] SORT_1 var_75 = var_75_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0] [L290] EXPR var_75 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0] [L290] var_75 = var_75 & mask_SORT_1 [L291] SORT_1 var_76_arg_0 = var_74; [L292] SORT_1 var_76_arg_1 = var_75; [L293] SORT_1 var_76 = var_76_arg_0 != var_76_arg_1; [L294] SORT_3 var_77_arg_0 = state_42; [L295] SORT_1 var_77 = var_77_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_76=0, var_77=0] [L296] EXPR var_77 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_76=0] [L296] var_77 = var_77 & mask_SORT_1 [L297] SORT_1 var_78_arg_0 = var_77; [L298] SORT_1 var_78_arg_1 = var_45; [L299] SORT_1 var_78 = var_78_arg_0 == var_78_arg_1; [L300] SORT_1 var_79_arg_0 = var_76; [L301] SORT_1 var_79_arg_1 = var_78; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_77=0, var_79_arg_0=0, var_79_arg_1=1] [L302] EXPR var_79_arg_0 | var_79_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_77=0] [L302] SORT_1 var_79 = var_79_arg_0 | var_79_arg_1; [L303] SORT_1 var_80_arg_0 = var_73; [L304] SORT_1 var_80_arg_1 = var_79; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_74=0, var_75=0, var_77=0, var_80_arg_0=1, var_80_arg_1=1] [L305] EXPR var_80_arg_0 & var_80_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_74=0, var_75=0, var_77=0] [L305] SORT_1 var_80 = var_80_arg_0 & var_80_arg_1; [L306] SORT_1 var_81_arg_0 = var_77; [L307] SORT_1 var_81_arg_1 = var_45; [L308] SORT_1 var_81 = var_81_arg_0 != var_81_arg_1; [L309] SORT_1 var_82_arg_0 = var_74; [L310] SORT_1 var_82_arg_1 = var_75; [L311] SORT_1 var_82 = var_82_arg_0 == var_82_arg_1; [L312] SORT_1 var_83_arg_0 = var_81; [L313] SORT_1 var_83_arg_1 = var_82; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_80=1, var_83_arg_0=0, var_83_arg_1=1] [L314] EXPR var_83_arg_0 | var_83_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_80=1] [L314] SORT_1 var_83 = var_83_arg_0 | var_83_arg_1; [L315] SORT_1 var_84_arg_0 = var_80; [L316] SORT_1 var_84_arg_1 = var_83; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84_arg_0=1, var_84_arg_1=1] [L317] EXPR var_84_arg_0 & var_84_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L317] SORT_1 var_84 = var_84_arg_0 & var_84_arg_1; [L318] SORT_3 var_85_arg_0 = state_35; [L319] SORT_1 var_85 = var_85_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0] [L320] EXPR var_85 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1] [L320] var_85 = var_85 & mask_SORT_1 [L321] SORT_3 var_86_arg_0 = state_38; [L322] SORT_1 var_86 = var_86_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0] [L323] EXPR var_86 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0] [L323] var_86 = var_86 & mask_SORT_1 [L324] SORT_1 var_87_arg_0 = var_85; [L325] SORT_1 var_87_arg_1 = var_86; [L326] SORT_1 var_87 = var_87_arg_0 != var_87_arg_1; [L327] SORT_3 var_88_arg_0 = state_42; [L328] SORT_1 var_88 = var_88_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_87=0, var_88=0] [L329] EXPR var_88 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_87=0] [L329] var_88 = var_88 & mask_SORT_1 [L330] SORT_1 var_89_arg_0 = var_88; [L331] SORT_1 var_89_arg_1 = var_45; [L332] SORT_1 var_89 = var_89_arg_0 == var_89_arg_1; [L333] SORT_1 var_90_arg_0 = var_87; [L334] SORT_1 var_90_arg_1 = var_89; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_88=0, var_90_arg_0=0, var_90_arg_1=1] [L335] EXPR var_90_arg_0 | var_90_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_88=0] [L335] SORT_1 var_90 = var_90_arg_0 | var_90_arg_1; [L336] SORT_1 var_91_arg_0 = var_84; [L337] SORT_1 var_91_arg_1 = var_90; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_85=0, var_86=0, var_88=0, var_91_arg_0=1, var_91_arg_1=1] [L338] EXPR var_91_arg_0 & var_91_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_85=0, var_86=0, var_88=0] [L338] SORT_1 var_91 = var_91_arg_0 & var_91_arg_1; [L339] SORT_1 var_92_arg_0 = var_88; [L340] SORT_1 var_92_arg_1 = var_45; [L341] SORT_1 var_92 = var_92_arg_0 != var_92_arg_1; [L342] SORT_1 var_93_arg_0 = var_85; [L343] SORT_1 var_93_arg_1 = var_86; [L344] SORT_1 var_93 = var_93_arg_0 == var_93_arg_1; [L345] SORT_1 var_94_arg_0 = var_92; [L346] SORT_1 var_94_arg_1 = var_93; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_91=1, var_94_arg_0=0, var_94_arg_1=1] [L347] EXPR var_94_arg_0 | var_94_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_91=1] [L347] SORT_1 var_94 = var_94_arg_0 | var_94_arg_1; [L348] SORT_1 var_95_arg_0 = var_91; [L349] SORT_1 var_95_arg_1 = var_94; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_95_arg_0=1, var_95_arg_1=1] [L350] EXPR var_95_arg_0 & var_95_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L350] SORT_1 var_95 = var_95_arg_0 & var_95_arg_1; [L351] SORT_1 var_96_arg_0 = var_33; [L352] SORT_1 var_96_arg_1 = var_95; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_96_arg_0=-1, var_96_arg_1=1] [L353] EXPR var_96_arg_0 | var_96_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L353] SORT_1 var_96 = var_96_arg_0 | var_96_arg_1; [L354] SORT_1 var_99_arg_0 = var_96; [L355] SORT_1 var_99 = ~var_99_arg_0; [L356] SORT_1 var_100_arg_0 = var_22; [L357] SORT_1 var_100_arg_1 = var_99; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_100_arg_0=1, var_100_arg_1=-1, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L358] EXPR var_100_arg_0 & var_100_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L358] SORT_1 var_100 = var_100_arg_0 & var_100_arg_1; [L359] EXPR var_100 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L359] var_100 = var_100 & mask_SORT_1 [L360] SORT_1 bad_101_arg_0 = var_100; [L361] CALL __VERIFIER_assert(!(bad_101_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 683 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6675 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6675 mSDsluCounter, 91818 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75874 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22117 IncrementalHoareTripleChecker+Invalid, 22155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 15944 mSDtfsCounter, 22117 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1185occurred 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, 1152 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2561 NumberOfCodeBlocks, 2561 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2406 ConstructedInterpolants, 0 QuantifiedInterpolants, 5594 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-03-03 18:32:46,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:32:48,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:32:48,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:32:48,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:32:48,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:32:48,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:32:48,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:32:48,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:32:48,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:32:48,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:32:48,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:32:48,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:32:48,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:32:48,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:32:48,822 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:32:48,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:32:48,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:32:48,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:48,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:32:48,824 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e [2025-03-03 18:32:49,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:32:49,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:32:49,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:32:49,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:32:49,079 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:32:49,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-03 18:32:50,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67e83de1/a9c0def94a624ccea4602abb5be21726/FLAGd26588450 [2025-03-03 18:32:50,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:32:50,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-03 18:32:50,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67e83de1/a9c0def94a624ccea4602abb5be21726/FLAGd26588450 [2025-03-03 18:32:50,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67e83de1/a9c0def94a624ccea4602abb5be21726 [2025-03-03 18:32:50,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:32:50,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:32:50,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:50,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:32:50,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:32:50,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:50" (1/1) ... [2025-03-03 18:32:50,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f26a544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:50, skipping insertion in model container [2025-03-03 18:32:50,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:50" (1/1) ... [2025-03-03 18:32:50,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:32:50,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-03-03 18:32:51,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:51,161 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:32:51,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c[1259,1272] [2025-03-03 18:32:51,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:51,284 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:32:51,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51 WrapperNode [2025-03-03 18:32:51,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:51,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:51,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:32:51,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:32:51,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,365 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1255 [2025-03-03 18:32:51,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:51,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:32:51,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:32:51,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:32:51,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,409 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:32:51,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:32:51,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:32:51,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:32:51,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:32:51,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (1/1) ... [2025-03-03 18:32:51,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:51,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:32:51,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:32:51,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:32:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:32:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:32:51,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:32:51,762 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:32:51,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:32:53,107 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2025-03-03 18:32:53,108 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:32:53,114 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:32:53,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:32:53,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:53 BoogieIcfgContainer [2025-03-03 18:32:53,115 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:32:53,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:32:53,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:32:53,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:32:53,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:32:50" (1/3) ... [2025-03-03 18:32:53,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d3a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:53, skipping insertion in model container [2025-03-03 18:32:53,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:51" (2/3) ... [2025-03-03 18:32:53,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d3a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:53, skipping insertion in model container [2025-03-03 18:32:53,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:53" (3/3) ... [2025-03-03 18:32:53,122 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-03-03 18:32:53,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:32:53,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:32:53,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:32:53,175 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;@787599af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:32:53,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:32:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:32:53,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:53,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:32:53,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:53,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:32:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:53,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905396528] [2025-03-03 18:32:53,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:53,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:53,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:53,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:53,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:32:53,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:32:53,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:32:53,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:53,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:53,532 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 142 conjuncts are in the unsatisfiable core [2025-03-03 18:32:53,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:54,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:32:54,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:32:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905396528] [2025-03-03 18:32:54,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905396528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:54,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:54,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770006420] [2025-03-03 18:32:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:54,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:32:54,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:54,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:54,581 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:54,688 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 18:32:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:54,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 18:32:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:54,693 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:32:54,694 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 18:32:54,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:54,699 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:54,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:32:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 18:32:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 18:32:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:32:54,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:32:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:54,721 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:32:54,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:32:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:32:54,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:54,722 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:54,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:32:54,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:54,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:54,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:32:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:54,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259953157] [2025-03-03 18:32:54,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:54,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:54,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:54,926 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:54,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:32:55,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:32:55,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:32:55,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:55,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:55,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-03-03 18:32:55,339 INFO L279 TraceCheckSpWp]: Computing forward predicates...