./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.h_Vending.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 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:54:05,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:54:05,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:54:05,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:54:05,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:54:05,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:54:05,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:54:05,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:54:05,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:54:05,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:54:05,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:54:05,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:54:05,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:54:05,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:54:05,431 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:54:05,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:54:05,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:54:05,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:54:05,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:54:05,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:54:05,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:54:05,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:54:05,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:54:05,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:54:05,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:54:05,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:54:05,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:54:05,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:54:05,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:54:05,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:05,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:54:05,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:54:05,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:54:05,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:54:05,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:54:05,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:54:05,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:54:05,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:54:05,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:54:05,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:54:05,434 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 -> 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 [2025-03-16 21:54:05,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:54:05,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:54:05,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:54:05,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:54:05,656 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:54:05,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2025-03-16 21:54:06,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478a26575/9fccc12c76c84430b1e88e24cbf717bc/FLAGd132c4f8c [2025-03-16 21:54:07,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:54:07,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2025-03-16 21:54:07,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478a26575/9fccc12c76c84430b1e88e24cbf717bc/FLAGd132c4f8c [2025-03-16 21:54:07,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478a26575/9fccc12c76c84430b1e88e24cbf717bc [2025-03-16 21:54:07,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:54:07,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:54:07,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:07,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:54:07,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:54:07,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da96fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07, skipping insertion in model container [2025-03-16 21:54:07,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:54:07,255 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.h_Vending.c[1249,1262] [2025-03-16 21:54:07,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:07,494 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:54:07,501 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.h_Vending.c[1249,1262] [2025-03-16 21:54:07,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:07,618 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:54:07,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07 WrapperNode [2025-03-16 21:54:07,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:07,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:07,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:54:07,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:54:07,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,807 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2217 [2025-03-16 21:54:07,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:07,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:54:07,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:54:07,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:54:07,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,898 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-16 21:54:07,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:07,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:54:07,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:54:07,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:54:07,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:54:08,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (1/1) ... [2025-03-16 21:54:08,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:08,059 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-16 21:54:08,061 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-16 21:54:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:54:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:54:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:54:08,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:54:08,306 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:54:08,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:54:09,719 INFO L? ?]: Removed 1501 outVars from TransFormulas that were not future-live. [2025-03-16 21:54:09,719 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:54:09,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:54:09,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:54:09,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:09 BoogieIcfgContainer [2025-03-16 21:54:09,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:54:09,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:54:09,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:54:09,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:54:09,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:54:07" (1/3) ... [2025-03-16 21:54:09,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261b1379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:09, skipping insertion in model container [2025-03-16 21:54:09,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:07" (2/3) ... [2025-03-16 21:54:09,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261b1379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:09, skipping insertion in model container [2025-03-16 21:54:09,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:09" (3/3) ... [2025-03-16 21:54:09,792 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vending.c [2025-03-16 21:54:09,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:54:09,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Vending.c that has 1 procedures, 324 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:54:09,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:54:09,886 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;@29c90c9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:54:09,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:54:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 322 states have (on average 1.5) internal successors, (483), 323 states have internal predecessors, (483), 0 states have call successors, (0), 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-16 21:54:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 21:54:09,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:09,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:09,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2096942056, now seen corresponding path program 1 times [2025-03-16 21:54:09,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:09,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292509329] [2025-03-16 21:54:09,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 21:54:10,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 21:54:10,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:10,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:10,751 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-16 21:54:10,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:10,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292509329] [2025-03-16 21:54:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292509329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:10,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:10,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279164259] [2025-03-16 21:54:10,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:10,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:10,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:10,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:10,781 INFO L87 Difference]: Start difference. First operand has 324 states, 322 states have (on average 1.5) internal successors, (483), 323 states have internal predecessors, (483), 0 states have call successors, (0), 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 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:11,003 INFO L93 Difference]: Finished difference Result 615 states and 919 transitions. [2025-03-16 21:54:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-16 21:54:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:11,015 INFO L225 Difference]: With dead ends: 615 [2025-03-16 21:54:11,015 INFO L226 Difference]: Without dead ends: 324 [2025-03-16 21:54:11,018 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-16 21:54:11,021 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:11,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1192 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-16 21:54:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-03-16 21:54:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4922600619195046) internal successors, (482), 323 states have internal predecessors, (482), 0 states have call successors, (0), 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-16 21:54:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 482 transitions. [2025-03-16 21:54:11,072 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 482 transitions. Word has length 98 [2025-03-16 21:54:11,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:11,073 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 482 transitions. [2025-03-16 21:54:11,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 482 transitions. [2025-03-16 21:54:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 21:54:11,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:11,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:11,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:54:11,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:11,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 585373663, now seen corresponding path program 1 times [2025-03-16 21:54:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:11,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277708274] [2025-03-16 21:54:11,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:11,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 21:54:11,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 21:54:11,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:11,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:11,422 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-16 21:54:11,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277708274] [2025-03-16 21:54:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277708274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:11,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:11,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889729041] [2025-03-16 21:54:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:11,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:11,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:11,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:11,426 INFO L87 Difference]: Start difference. First operand 324 states and 482 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:11,579 INFO L93 Difference]: Finished difference Result 617 states and 918 transitions. [2025-03-16 21:54:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:11,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 21:54:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:11,581 INFO L225 Difference]: With dead ends: 617 [2025-03-16 21:54:11,581 INFO L226 Difference]: Without dead ends: 326 [2025-03-16 21:54:11,582 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-16 21:54:11,582 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:11,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1189 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-16 21:54:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-16 21:54:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4892307692307691) internal successors, (484), 325 states have internal predecessors, (484), 0 states have call successors, (0), 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-16 21:54:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2025-03-16 21:54:11,599 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 99 [2025-03-16 21:54:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:11,600 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2025-03-16 21:54:11,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2025-03-16 21:54:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 21:54:11,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:11,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:11,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:54:11,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:11,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1396743485, now seen corresponding path program 1 times [2025-03-16 21:54:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538948860] [2025-03-16 21:54:11,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:11,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 21:54:11,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 21:54:11,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:11,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:12,106 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-16 21:54:12,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:12,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538948860] [2025-03-16 21:54:12,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538948860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:12,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:12,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:12,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391222478] [2025-03-16 21:54:12,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:12,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:12,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:12,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:12,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:12,109 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:12,308 INFO L93 Difference]: Finished difference Result 623 states and 925 transitions. [2025-03-16 21:54:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:12,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 21:54:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:12,313 INFO L225 Difference]: With dead ends: 623 [2025-03-16 21:54:12,313 INFO L226 Difference]: Without dead ends: 330 [2025-03-16 21:54:12,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:12,315 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 395 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:12,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1179 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-16 21:54:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2025-03-16 21:54:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4878048780487805) internal successors, (488), 328 states have internal predecessors, (488), 0 states have call successors, (0), 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-16 21:54:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 488 transitions. [2025-03-16 21:54:12,333 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 488 transitions. Word has length 100 [2025-03-16 21:54:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:12,333 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 488 transitions. [2025-03-16 21:54:12,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 488 transitions. [2025-03-16 21:54:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 21:54:12,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:12,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:12,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:54:12,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1830000273, now seen corresponding path program 1 times [2025-03-16 21:54:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283615819] [2025-03-16 21:54:12,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:12,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:12,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 21:54:12,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 21:54:12,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:12,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:12,906 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-16 21:54:12,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:12,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283615819] [2025-03-16 21:54:12,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283615819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:12,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:12,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871293657] [2025-03-16 21:54:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:12,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:12,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:12,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:12,908 INFO L87 Difference]: Start difference. First operand 329 states and 488 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:13,138 INFO L93 Difference]: Finished difference Result 628 states and 932 transitions. [2025-03-16 21:54:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 21:54:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:13,141 INFO L225 Difference]: With dead ends: 628 [2025-03-16 21:54:13,142 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 21:54:13,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:13,143 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 9 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:13,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1571 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 21:54:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 21:54:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.4833836858006042) internal successors, (491), 331 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 491 transitions. [2025-03-16 21:54:13,156 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 491 transitions. Word has length 101 [2025-03-16 21:54:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:13,157 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 491 transitions. [2025-03-16 21:54:13,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 491 transitions. [2025-03-16 21:54:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 21:54:13,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:13,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:13,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:54:13,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:13,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1454431910, now seen corresponding path program 1 times [2025-03-16 21:54:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:13,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810089727] [2025-03-16 21:54:13,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:13,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 21:54:13,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 21:54:13,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:13,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:13,419 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-16 21:54:13,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:13,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810089727] [2025-03-16 21:54:13,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810089727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:13,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:13,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:13,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985689989] [2025-03-16 21:54:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:13,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:13,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:13,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:13,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:13,421 INFO L87 Difference]: Start difference. First operand 332 states and 491 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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-16 21:54:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:13,579 INFO L93 Difference]: Finished difference Result 633 states and 936 transitions. [2025-03-16 21:54:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:13,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-16 21:54:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:13,581 INFO L225 Difference]: With dead ends: 633 [2025-03-16 21:54:13,581 INFO L226 Difference]: Without dead ends: 334 [2025-03-16 21:54:13,582 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-16 21:54:13,582 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:13,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1189 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-16 21:54:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-03-16 21:54:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 333 states have internal predecessors, (493), 0 states have call successors, (0), 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-16 21:54:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 493 transitions. [2025-03-16 21:54:13,593 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 493 transitions. Word has length 102 [2025-03-16 21:54:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:13,594 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 493 transitions. [2025-03-16 21:54:13,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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-16 21:54:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 493 transitions. [2025-03-16 21:54:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 21:54:13,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:13,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:13,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:54:13,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:13,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1303342549, now seen corresponding path program 1 times [2025-03-16 21:54:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:13,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881655509] [2025-03-16 21:54:13,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:13,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 21:54:13,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 21:54:13,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:13,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:14,102 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-16 21:54:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:14,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881655509] [2025-03-16 21:54:14,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881655509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:14,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:14,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795330865] [2025-03-16 21:54:14,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:14,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:14,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:14,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:14,105 INFO L87 Difference]: Start difference. First operand 334 states and 493 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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-16 21:54:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:14,294 INFO L93 Difference]: Finished difference Result 638 states and 942 transitions. [2025-03-16 21:54:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:14,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-16 21:54:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:14,296 INFO L225 Difference]: With dead ends: 638 [2025-03-16 21:54:14,296 INFO L226 Difference]: Without dead ends: 337 [2025-03-16 21:54:14,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:14,297 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 17 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:14,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1561 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-16 21:54:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-16 21:54:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.4761904761904763) internal successors, (496), 336 states have internal predecessors, (496), 0 states have call successors, (0), 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-16 21:54:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 496 transitions. [2025-03-16 21:54:14,306 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 496 transitions. Word has length 102 [2025-03-16 21:54:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 496 transitions. [2025-03-16 21:54:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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-16 21:54:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 496 transitions. [2025-03-16 21:54:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 21:54:14,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:14,307 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] [2025-03-16 21:54:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:54:14,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:14,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1236274253, now seen corresponding path program 1 times [2025-03-16 21:54:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:14,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506096323] [2025-03-16 21:54:14,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:14,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 21:54:14,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 21:54:14,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:14,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:15,357 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-16 21:54:15,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:15,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506096323] [2025-03-16 21:54:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506096323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:15,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116541684] [2025-03-16 21:54:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:15,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:15,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:15,359 INFO L87 Difference]: Start difference. First operand 337 states and 496 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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-16 21:54:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:15,854 INFO L93 Difference]: Finished difference Result 657 states and 967 transitions. [2025-03-16 21:54:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:54:15,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-16 21:54:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:15,856 INFO L225 Difference]: With dead ends: 657 [2025-03-16 21:54:15,856 INFO L226 Difference]: Without dead ends: 353 [2025-03-16 21:54:15,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:54:15,857 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 465 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:15,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2999 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-16 21:54:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 349. [2025-03-16 21:54:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4741379310344827) internal successors, (513), 348 states have internal predecessors, (513), 0 states have call successors, (0), 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-16 21:54:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 513 transitions. [2025-03-16 21:54:15,871 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 513 transitions. Word has length 103 [2025-03-16 21:54:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:15,872 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 513 transitions. [2025-03-16 21:54:15,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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-16 21:54:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 513 transitions. [2025-03-16 21:54:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 21:54:15,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:15,872 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] [2025-03-16 21:54:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:54:15,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:15,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -509434050, now seen corresponding path program 1 times [2025-03-16 21:54:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209859312] [2025-03-16 21:54:15,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:15,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 21:54:15,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 21:54:15,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:15,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:16,187 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-16 21:54:16,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:16,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209859312] [2025-03-16 21:54:16,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209859312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:16,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:16,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:16,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127577684] [2025-03-16 21:54:16,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:16,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:16,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:16,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:16,189 INFO L87 Difference]: Start difference. First operand 349 states and 513 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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-16 21:54:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:16,445 INFO L93 Difference]: Finished difference Result 669 states and 983 transitions. [2025-03-16 21:54:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:16,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 21:54:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:16,447 INFO L225 Difference]: With dead ends: 669 [2025-03-16 21:54:16,447 INFO L226 Difference]: Without dead ends: 353 [2025-03-16 21:54:16,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:16,448 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 441 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:16,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1001 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-16 21:54:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2025-03-16 21:54:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.4729344729344729) internal successors, (517), 351 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 517 transitions. [2025-03-16 21:54:16,456 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 517 transitions. Word has length 104 [2025-03-16 21:54:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:16,456 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 517 transitions. [2025-03-16 21:54:16,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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-16 21:54:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 517 transitions. [2025-03-16 21:54:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 21:54:16,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:16,458 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] [2025-03-16 21:54:16,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:54:16,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:16,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:16,460 INFO L85 PathProgramCache]: Analyzing trace with hash 849373650, now seen corresponding path program 1 times [2025-03-16 21:54:16,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:16,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942847363] [2025-03-16 21:54:16,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:16,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:16,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 21:54:16,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 21:54:16,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:16,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:17,051 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-16 21:54:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942847363] [2025-03-16 21:54:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942847363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:17,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:17,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:17,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853141347] [2025-03-16 21:54:17,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:17,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:54:17,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:17,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:54:17,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:17,054 INFO L87 Difference]: Start difference. First operand 352 states and 517 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 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-16 21:54:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:17,442 INFO L93 Difference]: Finished difference Result 683 states and 1003 transitions. [2025-03-16 21:54:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:54:17,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 21:54:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:17,444 INFO L225 Difference]: With dead ends: 683 [2025-03-16 21:54:17,444 INFO L226 Difference]: Without dead ends: 364 [2025-03-16 21:54:17,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:17,445 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 7 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:17,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3074 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-16 21:54:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2025-03-16 21:54:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.467966573816156) internal successors, (527), 359 states have internal predecessors, (527), 0 states have call successors, (0), 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-16 21:54:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 527 transitions. [2025-03-16 21:54:17,456 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 527 transitions. Word has length 104 [2025-03-16 21:54:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:17,456 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 527 transitions. [2025-03-16 21:54:17,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 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-16 21:54:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 527 transitions. [2025-03-16 21:54:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 21:54:17,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:17,457 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] [2025-03-16 21:54:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:54:17,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1115894778, now seen corresponding path program 1 times [2025-03-16 21:54:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911394726] [2025-03-16 21:54:17,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:17,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 21:54:17,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 21:54:17,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:17,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:17,796 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-16 21:54:17,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:17,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911394726] [2025-03-16 21:54:17,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911394726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:17,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:17,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:17,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790781756] [2025-03-16 21:54:17,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:17,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:17,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:17,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:17,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:17,798 INFO L87 Difference]: Start difference. First operand 360 states and 527 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 21:54:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:17,937 INFO L93 Difference]: Finished difference Result 686 states and 1004 transitions. [2025-03-16 21:54:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:17,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 21:54:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:17,939 INFO L225 Difference]: With dead ends: 686 [2025-03-16 21:54:17,939 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 21:54:17,940 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-16 21:54:17,940 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:17,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1187 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 21:54:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 21:54:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4664804469273742) internal successors, (525), 358 states have internal predecessors, (525), 0 states have call successors, (0), 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-16 21:54:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 525 transitions. [2025-03-16 21:54:17,947 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 525 transitions. Word has length 105 [2025-03-16 21:54:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 525 transitions. [2025-03-16 21:54:17,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 21:54:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 525 transitions. [2025-03-16 21:54:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 21:54:17,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:17,950 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] [2025-03-16 21:54:17,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:54:17,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:17,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash 252004860, now seen corresponding path program 1 times [2025-03-16 21:54:17,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:17,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596110510] [2025-03-16 21:54:17,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:17,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:17,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 21:54:18,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 21:54:18,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:18,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:18,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:18,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596110510] [2025-03-16 21:54:18,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596110510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:18,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:18,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809777684] [2025-03-16 21:54:18,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:18,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:54:18,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:18,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:54:18,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:18,617 INFO L87 Difference]: Start difference. First operand 359 states and 525 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 21:54:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:18,879 INFO L93 Difference]: Finished difference Result 710 states and 1038 transitions. [2025-03-16 21:54:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:54:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 21:54:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:18,881 INFO L225 Difference]: With dead ends: 710 [2025-03-16 21:54:18,881 INFO L226 Difference]: Without dead ends: 384 [2025-03-16 21:54:18,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:18,882 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 26 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:18,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1987 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-16 21:54:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2025-03-16 21:54:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.4638069705093835) internal successors, (546), 373 states have internal predecessors, (546), 0 states have call successors, (0), 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-16 21:54:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 546 transitions. [2025-03-16 21:54:18,889 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 546 transitions. Word has length 105 [2025-03-16 21:54:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:18,889 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 546 transitions. [2025-03-16 21:54:18,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 21:54:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 546 transitions. [2025-03-16 21:54:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 21:54:18,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:18,890 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] [2025-03-16 21:54:18,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:54:18,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:18,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 397987738, now seen corresponding path program 1 times [2025-03-16 21:54:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:18,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497703270] [2025-03-16 21:54:18,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:18,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:18,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 21:54:19,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 21:54:19,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:19,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:19,577 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-16 21:54:19,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:19,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497703270] [2025-03-16 21:54:19,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497703270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:19,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:19,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:54:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520266383] [2025-03-16 21:54:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:19,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:54:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:19,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:54:19,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:19,579 INFO L87 Difference]: Start difference. First operand 374 states and 546 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 21:54:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:20,249 INFO L93 Difference]: Finished difference Result 1154 states and 1674 transitions. [2025-03-16 21:54:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:54:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 21:54:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:20,252 INFO L225 Difference]: With dead ends: 1154 [2025-03-16 21:54:20,252 INFO L226 Difference]: Without dead ends: 813 [2025-03-16 21:54:20,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:54:20,254 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 1234 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:20,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 3147 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:54:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-16 21:54:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 459. [2025-03-16 21:54:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.460698689956332) internal successors, (669), 458 states have internal predecessors, (669), 0 states have call successors, (0), 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-16 21:54:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 669 transitions. [2025-03-16 21:54:20,266 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 669 transitions. Word has length 105 [2025-03-16 21:54:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:20,268 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 669 transitions. [2025-03-16 21:54:20,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 21:54:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 669 transitions. [2025-03-16 21:54:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 21:54:20,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:20,269 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] [2025-03-16 21:54:20,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:54:20,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:20,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2082462034, now seen corresponding path program 1 times [2025-03-16 21:54:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354455027] [2025-03-16 21:54:20,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:20,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 21:54:20,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 21:54:20,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:20,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:20,840 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-16 21:54:20,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:20,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354455027] [2025-03-16 21:54:20,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354455027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:20,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:20,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 21:54:20,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502327611] [2025-03-16 21:54:20,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:20,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 21:54:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:20,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 21:54:20,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:54:20,842 INFO L87 Difference]: Start difference. First operand 459 states and 669 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 21:54:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:21,740 INFO L93 Difference]: Finished difference Result 1075 states and 1560 transitions. [2025-03-16 21:54:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 21:54:21,740 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 21:54:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:21,743 INFO L225 Difference]: With dead ends: 1075 [2025-03-16 21:54:21,743 INFO L226 Difference]: Without dead ends: 680 [2025-03-16 21:54:21,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-03-16 21:54:21,745 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1165 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:21,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 3871 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-16 21:54:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 488. [2025-03-16 21:54:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.459958932238193) internal successors, (711), 487 states have internal predecessors, (711), 0 states have call successors, (0), 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-16 21:54:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 711 transitions. [2025-03-16 21:54:21,772 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 711 transitions. Word has length 105 [2025-03-16 21:54:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:21,772 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 711 transitions. [2025-03-16 21:54:21,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 21:54:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 711 transitions. [2025-03-16 21:54:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 21:54:21,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:21,773 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] [2025-03-16 21:54:21,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:54:21,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1779815609, now seen corresponding path program 1 times [2025-03-16 21:54:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596325590] [2025-03-16 21:54:21,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:21,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 21:54:21,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 21:54:21,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:21,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:21,907 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-16 21:54:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596325590] [2025-03-16 21:54:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596325590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:21,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:21,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:54:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10443187] [2025-03-16 21:54:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:21,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:21,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:21,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:21,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:21,909 INFO L87 Difference]: Start difference. First operand 488 states and 711 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 21:54:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:22,033 INFO L93 Difference]: Finished difference Result 860 states and 1250 transitions. [2025-03-16 21:54:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:22,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 21:54:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:22,034 INFO L225 Difference]: With dead ends: 860 [2025-03-16 21:54:22,035 INFO L226 Difference]: Without dead ends: 483 [2025-03-16 21:54:22,035 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-16 21:54:22,035 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 435 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:22,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 768 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:22,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-16 21:54:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-03-16 21:54:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.454356846473029) internal successors, (701), 482 states have internal predecessors, (701), 0 states have call successors, (0), 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-16 21:54:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 701 transitions. [2025-03-16 21:54:22,044 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 701 transitions. Word has length 106 [2025-03-16 21:54:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:22,045 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 701 transitions. [2025-03-16 21:54:22,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 21:54:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 701 transitions. [2025-03-16 21:54:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 21:54:22,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:22,046 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] [2025-03-16 21:54:22,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:54:22,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:22,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash 332666783, now seen corresponding path program 1 times [2025-03-16 21:54:22,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:22,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251003262] [2025-03-16 21:54:22,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:22,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 21:54:22,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 21:54:22,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:22,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:22,493 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-16 21:54:22,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:22,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251003262] [2025-03-16 21:54:22,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251003262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:22,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:22,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:54:22,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425937624] [2025-03-16 21:54:22,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:22,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:54:22,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:22,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:54:22,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:22,495 INFO L87 Difference]: Start difference. First operand 483 states and 701 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 21:54:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:22,777 INFO L93 Difference]: Finished difference Result 847 states and 1227 transitions. [2025-03-16 21:54:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:22,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 21:54:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:22,779 INFO L225 Difference]: With dead ends: 847 [2025-03-16 21:54:22,779 INFO L226 Difference]: Without dead ends: 504 [2025-03-16 21:54:22,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:22,781 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 7 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:22,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2308 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-16 21:54:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 497. [2025-03-16 21:54:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4495967741935485) internal successors, (719), 496 states have internal predecessors, (719), 0 states have call successors, (0), 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-16 21:54:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 719 transitions. [2025-03-16 21:54:22,788 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 719 transitions. Word has length 106 [2025-03-16 21:54:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:22,788 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 719 transitions. [2025-03-16 21:54:22,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 21:54:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 719 transitions. [2025-03-16 21:54:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 21:54:22,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:22,789 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] [2025-03-16 21:54:22,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:54:22,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:22,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2134630639, now seen corresponding path program 1 times [2025-03-16 21:54:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826922813] [2025-03-16 21:54:22,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:22,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 21:54:22,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 21:54:22,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:22,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:23,082 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-16 21:54:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826922813] [2025-03-16 21:54:23,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826922813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:23,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:23,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:23,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162092573] [2025-03-16 21:54:23,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:23,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:23,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:23,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:23,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:23,084 INFO L87 Difference]: Start difference. First operand 497 states and 719 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 21:54:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:23,260 INFO L93 Difference]: Finished difference Result 849 states and 1230 transitions. [2025-03-16 21:54:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 21:54:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:23,263 INFO L225 Difference]: With dead ends: 849 [2025-03-16 21:54:23,263 INFO L226 Difference]: Without dead ends: 501 [2025-03-16 21:54:23,263 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-16 21:54:23,264 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 3 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:23,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1556 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-16 21:54:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 495. [2025-03-16 21:54:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.451417004048583) internal successors, (717), 494 states have internal predecessors, (717), 0 states have call successors, (0), 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-16 21:54:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 717 transitions. [2025-03-16 21:54:23,272 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 717 transitions. Word has length 106 [2025-03-16 21:54:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:23,272 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 717 transitions. [2025-03-16 21:54:23,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 21:54:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 717 transitions. [2025-03-16 21:54:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 21:54:23,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:23,273 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] [2025-03-16 21:54:23,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:54:23,274 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:23,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1922595889, now seen corresponding path program 1 times [2025-03-16 21:54:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:23,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222211710] [2025-03-16 21:54:23,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:23,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 21:54:23,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 21:54:23,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:23,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:23,781 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-16 21:54:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:23,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222211710] [2025-03-16 21:54:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222211710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582250186] [2025-03-16 21:54:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:23,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:23,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:23,784 INFO L87 Difference]: Start difference. First operand 495 states and 717 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 21:54:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:24,496 INFO L93 Difference]: Finished difference Result 1080 states and 1564 transitions. [2025-03-16 21:54:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:24,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 21:54:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:24,499 INFO L225 Difference]: With dead ends: 1080 [2025-03-16 21:54:24,499 INFO L226 Difference]: Without dead ends: 730 [2025-03-16 21:54:24,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:24,500 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 745 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:24,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1404 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-16 21:54:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 597. [2025-03-16 21:54:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.4463087248322148) internal successors, (862), 596 states have internal predecessors, (862), 0 states have call successors, (0), 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-16 21:54:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 862 transitions. [2025-03-16 21:54:24,509 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 862 transitions. Word has length 106 [2025-03-16 21:54:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:24,510 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 862 transitions. [2025-03-16 21:54:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 21:54:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 862 transitions. [2025-03-16 21:54:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 21:54:24,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:24,511 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] [2025-03-16 21:54:24,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:54:24,511 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:24,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash 342502247, now seen corresponding path program 1 times [2025-03-16 21:54:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:24,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899370672] [2025-03-16 21:54:24,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:24,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 21:54:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 21:54:24,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:24,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:25,088 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-16 21:54:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899370672] [2025-03-16 21:54:25,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899370672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:25,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598268854] [2025-03-16 21:54:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:25,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:25,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:25,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:25,090 INFO L87 Difference]: Start difference. First operand 597 states and 862 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 21:54:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:25,406 INFO L93 Difference]: Finished difference Result 1481 states and 2127 transitions. [2025-03-16 21:54:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-16 21:54:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:25,410 INFO L225 Difference]: With dead ends: 1481 [2025-03-16 21:54:25,410 INFO L226 Difference]: Without dead ends: 1016 [2025-03-16 21:54:25,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:25,412 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1107 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2060 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-16 21:54:25,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 2060 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-16 21:54:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 590. [2025-03-16 21:54:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.4465195246179967) internal successors, (852), 589 states have internal predecessors, (852), 0 states have call successors, (0), 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-16 21:54:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 852 transitions. [2025-03-16 21:54:25,423 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 852 transitions. Word has length 107 [2025-03-16 21:54:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:25,424 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 852 transitions. [2025-03-16 21:54:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 21:54:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 852 transitions. [2025-03-16 21:54:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 21:54:25,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:25,425 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] [2025-03-16 21:54:25,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:54:25,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:25,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1650386950, now seen corresponding path program 1 times [2025-03-16 21:54:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39862414] [2025-03-16 21:54:25,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:25,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 21:54:25,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 21:54:25,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:25,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:25,981 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-16 21:54:25,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:25,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39862414] [2025-03-16 21:54:25,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39862414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:25,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:25,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:25,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878169190] [2025-03-16 21:54:25,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:25,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:25,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:25,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:25,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:25,982 INFO L87 Difference]: Start difference. First operand 590 states and 852 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 21:54:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:26,231 INFO L93 Difference]: Finished difference Result 1320 states and 1899 transitions. [2025-03-16 21:54:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:26,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-16 21:54:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:26,235 INFO L225 Difference]: With dead ends: 1320 [2025-03-16 21:54:26,235 INFO L226 Difference]: Without dead ends: 868 [2025-03-16 21:54:26,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:26,236 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 679 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:26,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1125 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-16 21:54:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 663. [2025-03-16 21:54:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4395770392749245) internal successors, (953), 662 states have internal predecessors, (953), 0 states have call successors, (0), 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-16 21:54:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 953 transitions. [2025-03-16 21:54:26,246 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 953 transitions. Word has length 107 [2025-03-16 21:54:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:26,247 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 953 transitions. [2025-03-16 21:54:26,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 21:54:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 953 transitions. [2025-03-16 21:54:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 21:54:26,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:26,248 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] [2025-03-16 21:54:26,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:54:26,249 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:26,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -970678044, now seen corresponding path program 1 times [2025-03-16 21:54:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224576007] [2025-03-16 21:54:26,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:26,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 21:54:26,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 21:54:26,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:26,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:26,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-16 21:54:26,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224576007] [2025-03-16 21:54:26,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224576007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424164631] [2025-03-16 21:54:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:26,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:26,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:26,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:26,828 INFO L87 Difference]: Start difference. First operand 663 states and 953 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 21:54:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:27,129 INFO L93 Difference]: Finished difference Result 1310 states and 1882 transitions. [2025-03-16 21:54:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-16 21:54:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:27,132 INFO L225 Difference]: With dead ends: 1310 [2025-03-16 21:54:27,132 INFO L226 Difference]: Without dead ends: 858 [2025-03-16 21:54:27,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:27,133 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 668 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:27,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1123 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-16 21:54:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 707. [2025-03-16 21:54:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.434844192634561) internal successors, (1013), 706 states have internal predecessors, (1013), 0 states have call successors, (0), 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-16 21:54:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1013 transitions. [2025-03-16 21:54:27,142 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1013 transitions. Word has length 107 [2025-03-16 21:54:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:27,143 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1013 transitions. [2025-03-16 21:54:27,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 21:54:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1013 transitions. [2025-03-16 21:54:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 21:54:27,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:27,144 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] [2025-03-16 21:54:27,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:54:27,144 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:27,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2022193529, now seen corresponding path program 1 times [2025-03-16 21:54:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440928398] [2025-03-16 21:54:27,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:27,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 21:54:27,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 21:54:27,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:27,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:27,857 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-16 21:54:27,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:27,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440928398] [2025-03-16 21:54:27,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440928398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:27,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:27,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 21:54:27,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293719284] [2025-03-16 21:54:27,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 21:54:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:27,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 21:54:27,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:54:27,861 INFO L87 Difference]: Start difference. First operand 707 states and 1013 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:28,338 INFO L93 Difference]: Finished difference Result 1256 states and 1799 transitions. [2025-03-16 21:54:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 21:54:28,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 21:54:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:28,344 INFO L225 Difference]: With dead ends: 1256 [2025-03-16 21:54:28,345 INFO L226 Difference]: Without dead ends: 800 [2025-03-16 21:54:28,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-16 21:54:28,347 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 461 mSDsluCounter, 3568 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:28,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 3972 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-16 21:54:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 788. [2025-03-16 21:54:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4243964421855146) internal successors, (1121), 787 states have internal predecessors, (1121), 0 states have call successors, (0), 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-16 21:54:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1121 transitions. [2025-03-16 21:54:28,360 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1121 transitions. Word has length 108 [2025-03-16 21:54:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:28,360 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1121 transitions. [2025-03-16 21:54:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1121 transitions. [2025-03-16 21:54:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 21:54:28,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:28,362 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] [2025-03-16 21:54:28,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:54:28,363 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:28,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash -740750082, now seen corresponding path program 1 times [2025-03-16 21:54:28,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:28,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896024794] [2025-03-16 21:54:28,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:28,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:28,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 21:54:28,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 21:54:28,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:28,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:28,899 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-16 21:54:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896024794] [2025-03-16 21:54:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896024794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:28,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:28,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:28,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634122818] [2025-03-16 21:54:28,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:28,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:28,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:28,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:28,901 INFO L87 Difference]: Start difference. First operand 788 states and 1121 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:29,680 INFO L93 Difference]: Finished difference Result 1465 states and 2093 transitions. [2025-03-16 21:54:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:29,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 21:54:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:29,684 INFO L225 Difference]: With dead ends: 1465 [2025-03-16 21:54:29,684 INFO L226 Difference]: Without dead ends: 921 [2025-03-16 21:54:29,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:29,686 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 709 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:29,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1982 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:54:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-16 21:54:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 788. [2025-03-16 21:54:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4193138500635325) internal successors, (1117), 787 states have internal predecessors, (1117), 0 states have call successors, (0), 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-16 21:54:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1117 transitions. [2025-03-16 21:54:29,697 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1117 transitions. Word has length 108 [2025-03-16 21:54:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:29,697 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1117 transitions. [2025-03-16 21:54:29,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1117 transitions. [2025-03-16 21:54:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 21:54:29,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:29,699 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] [2025-03-16 21:54:29,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:54:29,699 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:29,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 976580328, now seen corresponding path program 1 times [2025-03-16 21:54:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:29,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111649679] [2025-03-16 21:54:29,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:29,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 21:54:29,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 21:54:29,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:29,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:30,322 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-16 21:54:30,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:30,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111649679] [2025-03-16 21:54:30,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111649679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:30,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:30,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 21:54:30,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607366637] [2025-03-16 21:54:30,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:30,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 21:54:30,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:30,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 21:54:30,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:54:30,324 INFO L87 Difference]: Start difference. First operand 788 states and 1117 transitions. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 14 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:30,939 INFO L93 Difference]: Finished difference Result 1641 states and 2319 transitions. [2025-03-16 21:54:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 21:54:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 14 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 21:54:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:30,941 INFO L225 Difference]: With dead ends: 1641 [2025-03-16 21:54:30,941 INFO L226 Difference]: Without dead ends: 931 [2025-03-16 21:54:30,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2025-03-16 21:54:30,942 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1105 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 4118 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:30,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 4118 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-16 21:54:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 785. [2025-03-16 21:54:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 1.4170918367346939) internal successors, (1111), 784 states have internal predecessors, (1111), 0 states have call successors, (0), 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-16 21:54:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1111 transitions. [2025-03-16 21:54:30,952 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1111 transitions. Word has length 108 [2025-03-16 21:54:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:30,953 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1111 transitions. [2025-03-16 21:54:30,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 14 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1111 transitions. [2025-03-16 21:54:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 21:54:30,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:30,954 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] [2025-03-16 21:54:30,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:54:30,954 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:30,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2035539251, now seen corresponding path program 1 times [2025-03-16 21:54:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:30,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004323059] [2025-03-16 21:54:30,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:30,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 21:54:31,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 21:54:31,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:31,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:31,151 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-16 21:54:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004323059] [2025-03-16 21:54:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004323059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386896400] [2025-03-16 21:54:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:31,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:31,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:31,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:31,153 INFO L87 Difference]: Start difference. First operand 785 states and 1111 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:31,341 INFO L93 Difference]: Finished difference Result 1491 states and 2106 transitions. [2025-03-16 21:54:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:31,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 21:54:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:31,343 INFO L225 Difference]: With dead ends: 1491 [2025-03-16 21:54:31,343 INFO L226 Difference]: Without dead ends: 800 [2025-03-16 21:54:31,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:31,344 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 445 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:31,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1876 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-16 21:54:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-03-16 21:54:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.4130162703379223) internal successors, (1129), 799 states have internal predecessors, (1129), 0 states have call successors, (0), 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-16 21:54:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1129 transitions. [2025-03-16 21:54:31,352 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1129 transitions. Word has length 108 [2025-03-16 21:54:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:31,352 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1129 transitions. [2025-03-16 21:54:31,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1129 transitions. [2025-03-16 21:54:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 21:54:31,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:31,353 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] [2025-03-16 21:54:31,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:54:31,353 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:31,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash 593949940, now seen corresponding path program 1 times [2025-03-16 21:54:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639956061] [2025-03-16 21:54:31,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:31,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 21:54:31,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 21:54:31,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:31,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:31,544 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-16 21:54:31,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639956061] [2025-03-16 21:54:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639956061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:31,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:31,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340366875] [2025-03-16 21:54:31,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:31,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:31,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:31,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:31,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:31,562 INFO L87 Difference]: Start difference. First operand 800 states and 1129 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:31,851 INFO L93 Difference]: Finished difference Result 1545 states and 2177 transitions. [2025-03-16 21:54:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 21:54:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:31,855 INFO L225 Difference]: With dead ends: 1545 [2025-03-16 21:54:31,855 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 21:54:31,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:31,856 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 450 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:31,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1455 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 21:54:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-16 21:54:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.4077306733167083) internal successors, (1129), 802 states have internal predecessors, (1129), 0 states have call successors, (0), 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-16 21:54:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1129 transitions. [2025-03-16 21:54:31,879 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1129 transitions. Word has length 108 [2025-03-16 21:54:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:31,879 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1129 transitions. [2025-03-16 21:54:31,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1129 transitions. [2025-03-16 21:54:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 21:54:31,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:31,880 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] [2025-03-16 21:54:31,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 21:54:31,880 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:31,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:31,880 INFO L85 PathProgramCache]: Analyzing trace with hash 551603242, now seen corresponding path program 1 times [2025-03-16 21:54:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351693121] [2025-03-16 21:54:31,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:31,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:31,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 21:54:31,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 21:54:31,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:31,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:32,002 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-16 21:54:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351693121] [2025-03-16 21:54:32,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351693121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:32,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:32,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:54:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065404780] [2025-03-16 21:54:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:32,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:32,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:32,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:32,003 INFO L87 Difference]: Start difference. First operand 803 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:32,102 INFO L93 Difference]: Finished difference Result 1513 states and 2127 transitions. [2025-03-16 21:54:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:32,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 21:54:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:32,105 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 21:54:32,105 INFO L226 Difference]: Without dead ends: 793 [2025-03-16 21:54:32,106 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-16 21:54:32,106 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 445 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:32,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 760 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-16 21:54:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2025-03-16 21:54:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.4065656565656566) internal successors, (1114), 792 states have internal predecessors, (1114), 0 states have call successors, (0), 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-16 21:54:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1114 transitions. [2025-03-16 21:54:32,115 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1114 transitions. Word has length 108 [2025-03-16 21:54:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:32,115 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1114 transitions. [2025-03-16 21:54:32,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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-16 21:54:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1114 transitions. [2025-03-16 21:54:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 21:54:32,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:32,116 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] [2025-03-16 21:54:32,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 21:54:32,117 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:32,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1336681264, now seen corresponding path program 1 times [2025-03-16 21:54:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803033566] [2025-03-16 21:54:32,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:32,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:32,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 21:54:32,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 21:54:32,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:32,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:32,246 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-16 21:54:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803033566] [2025-03-16 21:54:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803033566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:32,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:32,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071391147] [2025-03-16 21:54:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:32,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:32,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:32,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:32,249 INFO L87 Difference]: Start difference. First operand 793 states and 1114 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:32,770 INFO L93 Difference]: Finished difference Result 1657 states and 2326 transitions. [2025-03-16 21:54:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 21:54:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:32,772 INFO L225 Difference]: With dead ends: 1657 [2025-03-16 21:54:32,772 INFO L226 Difference]: Without dead ends: 919 [2025-03-16 21:54:32,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:32,773 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 989 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:32,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1123 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2025-03-16 21:54:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 765. [2025-03-16 21:54:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.4044502617801047) internal successors, (1073), 764 states have internal predecessors, (1073), 0 states have call successors, (0), 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-16 21:54:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1073 transitions. [2025-03-16 21:54:32,780 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1073 transitions. Word has length 109 [2025-03-16 21:54:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:32,780 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1073 transitions. [2025-03-16 21:54:32,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1073 transitions. [2025-03-16 21:54:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 21:54:32,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:32,781 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] [2025-03-16 21:54:32,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 21:54:32,781 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash -496785264, now seen corresponding path program 1 times [2025-03-16 21:54:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:32,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164828152] [2025-03-16 21:54:32,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:32,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 21:54:32,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 21:54:32,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:32,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:32,913 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-16 21:54:32,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:32,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164828152] [2025-03-16 21:54:32,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164828152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:32,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:32,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:32,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374499329] [2025-03-16 21:54:32,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:32,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:32,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:32,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:32,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:32,914 INFO L87 Difference]: Start difference. First operand 765 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:33,092 INFO L93 Difference]: Finished difference Result 1630 states and 2289 transitions. [2025-03-16 21:54:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 21:54:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:33,094 INFO L225 Difference]: With dead ends: 1630 [2025-03-16 21:54:33,094 INFO L226 Difference]: Without dead ends: 936 [2025-03-16 21:54:33,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:33,094 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1031 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:33,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1132 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-16 21:54:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 762. [2025-03-16 21:54:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 761 states have (on average 1.402102496714849) internal successors, (1067), 761 states have internal predecessors, (1067), 0 states have call successors, (0), 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-16 21:54:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1067 transitions. [2025-03-16 21:54:33,101 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1067 transitions. Word has length 109 [2025-03-16 21:54:33,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:33,101 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1067 transitions. [2025-03-16 21:54:33,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1067 transitions. [2025-03-16 21:54:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 21:54:33,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:33,102 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] [2025-03-16 21:54:33,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 21:54:33,102 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:33,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash -146504503, now seen corresponding path program 1 times [2025-03-16 21:54:33,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:33,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214578930] [2025-03-16 21:54:33,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:33,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 21:54:33,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 21:54:33,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:33,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:33,440 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-16 21:54:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214578930] [2025-03-16 21:54:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214578930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:33,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:33,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859853604] [2025-03-16 21:54:33,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:33,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:33,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:33,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:33,441 INFO L87 Difference]: Start difference. First operand 762 states and 1067 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:33,659 INFO L93 Difference]: Finished difference Result 1266 states and 1786 transitions. [2025-03-16 21:54:33,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:33,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 21:54:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:33,664 INFO L225 Difference]: With dead ends: 1266 [2025-03-16 21:54:33,664 INFO L226 Difference]: Without dead ends: 762 [2025-03-16 21:54:33,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:33,665 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 3 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:33,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1916 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-16 21:54:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 760. [2025-03-16 21:54:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.4005270092226614) internal successors, (1063), 759 states have internal predecessors, (1063), 0 states have call successors, (0), 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-16 21:54:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1063 transitions. [2025-03-16 21:54:33,673 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1063 transitions. Word has length 109 [2025-03-16 21:54:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:33,673 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1063 transitions. [2025-03-16 21:54:33,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1063 transitions. [2025-03-16 21:54:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 21:54:33,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:33,674 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] [2025-03-16 21:54:33,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 21:54:33,674 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:33,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1197067824, now seen corresponding path program 1 times [2025-03-16 21:54:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470313976] [2025-03-16 21:54:33,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:33,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 21:54:33,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 21:54:33,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:33,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:34,086 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-16 21:54:34,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:34,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470313976] [2025-03-16 21:54:34,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470313976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:34,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:34,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867268693] [2025-03-16 21:54:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:34,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:34,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:34,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:34,087 INFO L87 Difference]: Start difference. First operand 760 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:34,189 INFO L93 Difference]: Finished difference Result 1260 states and 1776 transitions. [2025-03-16 21:54:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 21:54:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:34,191 INFO L225 Difference]: With dead ends: 1260 [2025-03-16 21:54:34,191 INFO L226 Difference]: Without dead ends: 758 [2025-03-16 21:54:34,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:34,192 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 0 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:34,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-16 21:54:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2025-03-16 21:54:34,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.3976221928665786) internal successors, (1058), 757 states have internal predecessors, (1058), 0 states have call successors, (0), 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-16 21:54:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1058 transitions. [2025-03-16 21:54:34,205 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1058 transitions. Word has length 109 [2025-03-16 21:54:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:34,205 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1058 transitions. [2025-03-16 21:54:34,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1058 transitions. [2025-03-16 21:54:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 21:54:34,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:34,206 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] [2025-03-16 21:54:34,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 21:54:34,206 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:34,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1506372338, now seen corresponding path program 1 times [2025-03-16 21:54:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:34,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449299325] [2025-03-16 21:54:34,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:34,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 21:54:34,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 21:54:34,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:34,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:34,435 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-16 21:54:34,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:34,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449299325] [2025-03-16 21:54:34,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449299325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:34,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:34,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:34,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347707461] [2025-03-16 21:54:34,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:34,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:34,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:34,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:34,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:34,436 INFO L87 Difference]: Start difference. First operand 758 states and 1058 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:34,622 INFO L93 Difference]: Finished difference Result 1509 states and 2121 transitions. [2025-03-16 21:54:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:34,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 21:54:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:34,624 INFO L225 Difference]: With dead ends: 1509 [2025-03-16 21:54:34,624 INFO L226 Difference]: Without dead ends: 1001 [2025-03-16 21:54:34,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:34,625 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 673 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:34,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 2059 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-03-16 21:54:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 818. [2025-03-16 21:54:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 1.394124847001224) internal successors, (1139), 817 states have internal predecessors, (1139), 0 states have call successors, (0), 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-16 21:54:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1139 transitions. [2025-03-16 21:54:34,632 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1139 transitions. Word has length 109 [2025-03-16 21:54:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:34,632 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1139 transitions. [2025-03-16 21:54:34,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1139 transitions. [2025-03-16 21:54:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 21:54:34,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:34,633 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] [2025-03-16 21:54:34,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 21:54:34,633 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:34,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1954539509, now seen corresponding path program 1 times [2025-03-16 21:54:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:34,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304204029] [2025-03-16 21:54:34,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:34,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 21:54:34,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 21:54:34,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:34,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:34,876 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-16 21:54:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:34,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304204029] [2025-03-16 21:54:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304204029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040134255] [2025-03-16 21:54:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:34,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:34,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:34,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:34,877 INFO L87 Difference]: Start difference. First operand 818 states and 1139 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:35,225 INFO L93 Difference]: Finished difference Result 1749 states and 2435 transitions. [2025-03-16 21:54:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:35,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 21:54:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:35,227 INFO L225 Difference]: With dead ends: 1749 [2025-03-16 21:54:35,227 INFO L226 Difference]: Without dead ends: 991 [2025-03-16 21:54:35,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:54:35,228 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 1027 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:35,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1586 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-16 21:54:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 819. [2025-03-16 21:54:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.3924205378973105) internal successors, (1139), 818 states have internal predecessors, (1139), 0 states have call successors, (0), 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-16 21:54:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1139 transitions. [2025-03-16 21:54:35,237 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1139 transitions. Word has length 109 [2025-03-16 21:54:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:35,237 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1139 transitions. [2025-03-16 21:54:35,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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-16 21:54:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1139 transitions. [2025-03-16 21:54:35,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 21:54:35,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:35,238 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] [2025-03-16 21:54:35,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 21:54:35,238 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:35,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:35,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1041708278, now seen corresponding path program 1 times [2025-03-16 21:54:35,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:35,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776179186] [2025-03-16 21:54:35,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:35,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:35,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 21:54:35,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 21:54:35,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:35,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:35,802 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-16 21:54:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:35,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776179186] [2025-03-16 21:54:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776179186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:35,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337029708] [2025-03-16 21:54:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:35,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:35,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:35,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:35,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:35,803 INFO L87 Difference]: Start difference. First operand 819 states and 1139 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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-16 21:54:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:35,986 INFO L93 Difference]: Finished difference Result 1499 states and 2097 transitions. [2025-03-16 21:54:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-16 21:54:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:35,989 INFO L225 Difference]: With dead ends: 1499 [2025-03-16 21:54:35,989 INFO L226 Difference]: Without dead ends: 947 [2025-03-16 21:54:35,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:35,990 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 795 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:35,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1110 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-16 21:54:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 844. [2025-03-16 21:54:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.387900355871886) internal successors, (1170), 843 states have internal predecessors, (1170), 0 states have call successors, (0), 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-16 21:54:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1170 transitions. [2025-03-16 21:54:35,997 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1170 transitions. Word has length 110 [2025-03-16 21:54:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:35,997 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1170 transitions. [2025-03-16 21:54:35,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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-16 21:54:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1170 transitions. [2025-03-16 21:54:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 21:54:35,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:35,998 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] [2025-03-16 21:54:35,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 21:54:35,998 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:35,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1483920923, now seen corresponding path program 1 times [2025-03-16 21:54:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:35,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31365661] [2025-03-16 21:54:35,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:35,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:36,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 21:54:36,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 21:54:36,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:36,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:36,507 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-16 21:54:36,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:36,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31365661] [2025-03-16 21:54:36,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31365661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:36,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:36,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:54:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549746403] [2025-03-16 21:54:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:36,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:54:36,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:36,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:54:36,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:36,508 INFO L87 Difference]: Start difference. First operand 844 states and 1170 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 21:54:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:37,105 INFO L93 Difference]: Finished difference Result 1603 states and 2251 transitions. [2025-03-16 21:54:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:54:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 21:54:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:37,107 INFO L225 Difference]: With dead ends: 1603 [2025-03-16 21:54:37,107 INFO L226 Difference]: Without dead ends: 1051 [2025-03-16 21:54:37,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:54:37,108 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 1178 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:37,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 2142 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:54:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-16 21:54:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 860. [2025-03-16 21:54:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 1.3876600698486612) internal successors, (1192), 859 states have internal predecessors, (1192), 0 states have call successors, (0), 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-16 21:54:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1192 transitions. [2025-03-16 21:54:37,115 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1192 transitions. Word has length 111 [2025-03-16 21:54:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:37,116 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1192 transitions. [2025-03-16 21:54:37,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 21:54:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1192 transitions. [2025-03-16 21:54:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 21:54:37,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:37,116 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] [2025-03-16 21:54:37,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 21:54:37,117 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1892258614, now seen corresponding path program 1 times [2025-03-16 21:54:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121526013] [2025-03-16 21:54:37,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:37,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 21:54:37,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 21:54:37,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:37,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:37,573 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-16 21:54:37,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:37,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121526013] [2025-03-16 21:54:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121526013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:37,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:37,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951374507] [2025-03-16 21:54:37,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:37,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:37,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:37,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:37,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:37,576 INFO L87 Difference]: Start difference. First operand 860 states and 1192 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 21:54:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:37,846 INFO L93 Difference]: Finished difference Result 1571 states and 2201 transitions. [2025-03-16 21:54:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:37,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 21:54:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:37,848 INFO L225 Difference]: With dead ends: 1571 [2025-03-16 21:54:37,848 INFO L226 Difference]: Without dead ends: 1019 [2025-03-16 21:54:37,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:37,849 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 270 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:37,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1793 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-03-16 21:54:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 864. [2025-03-16 21:54:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 1.3858632676709155) internal successors, (1196), 863 states have internal predecessors, (1196), 0 states have call successors, (0), 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-16 21:54:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1196 transitions. [2025-03-16 21:54:37,856 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1196 transitions. Word has length 111 [2025-03-16 21:54:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:37,856 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1196 transitions. [2025-03-16 21:54:37,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 21:54:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1196 transitions. [2025-03-16 21:54:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 21:54:37,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:37,857 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] [2025-03-16 21:54:37,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 21:54:37,857 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:37,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:37,858 INFO L85 PathProgramCache]: Analyzing trace with hash -364681733, now seen corresponding path program 1 times [2025-03-16 21:54:37,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:37,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131970925] [2025-03-16 21:54:37,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:37,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:37,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 21:54:37,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 21:54:37,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:37,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:38,017 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-16 21:54:38,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:38,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131970925] [2025-03-16 21:54:38,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131970925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:38,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792869874] [2025-03-16 21:54:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:38,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:38,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:38,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:38,018 INFO L87 Difference]: Start difference. First operand 864 states and 1196 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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-16 21:54:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:38,170 INFO L93 Difference]: Finished difference Result 1428 states and 1993 transitions. [2025-03-16 21:54:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-16 21:54:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:38,172 INFO L225 Difference]: With dead ends: 1428 [2025-03-16 21:54:38,172 INFO L226 Difference]: Without dead ends: 876 [2025-03-16 21:54:38,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:38,173 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 2 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:38,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1534 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:38,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-16 21:54:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 874. [2025-03-16 21:54:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.3837342497136311) internal successors, (1208), 873 states have internal predecessors, (1208), 0 states have call successors, (0), 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-16 21:54:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1208 transitions. [2025-03-16 21:54:38,179 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1208 transitions. Word has length 112 [2025-03-16 21:54:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:38,179 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1208 transitions. [2025-03-16 21:54:38,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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-16 21:54:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1208 transitions. [2025-03-16 21:54:38,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 21:54:38,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:38,179 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] [2025-03-16 21:54:38,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 21:54:38,180 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:38,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1408013460, now seen corresponding path program 1 times [2025-03-16 21:54:38,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:38,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748080153] [2025-03-16 21:54:38,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:38,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 21:54:38,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 21:54:38,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:38,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:38,514 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-16 21:54:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748080153] [2025-03-16 21:54:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748080153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:38,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:38,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682591720] [2025-03-16 21:54:38,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:38,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:38,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:38,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:38,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:38,516 INFO L87 Difference]: Start difference. First operand 874 states and 1208 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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-16 21:54:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:38,628 INFO L93 Difference]: Finished difference Result 1442 states and 2009 transitions. [2025-03-16 21:54:38,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-16 21:54:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:38,630 INFO L225 Difference]: With dead ends: 1442 [2025-03-16 21:54:38,630 INFO L226 Difference]: Without dead ends: 866 [2025-03-16 21:54:38,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:38,631 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:38,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 773 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-16 21:54:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2025-03-16 21:54:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 1.3803468208092486) internal successors, (1194), 865 states have internal predecessors, (1194), 0 states have call successors, (0), 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-16 21:54:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1194 transitions. [2025-03-16 21:54:38,638 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1194 transitions. Word has length 112 [2025-03-16 21:54:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:38,638 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1194 transitions. [2025-03-16 21:54:38,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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-16 21:54:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1194 transitions. [2025-03-16 21:54:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 21:54:38,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:38,639 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] [2025-03-16 21:54:38,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 21:54:38,639 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:38,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1928898080, now seen corresponding path program 1 times [2025-03-16 21:54:38,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:38,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434752991] [2025-03-16 21:54:38,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:38,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 21:54:38,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 21:54:38,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:38,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:38,994 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-16 21:54:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434752991] [2025-03-16 21:54:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434752991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:38,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:38,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:38,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941597671] [2025-03-16 21:54:38,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:38,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:38,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:38,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:38,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:38,995 INFO L87 Difference]: Start difference. First operand 866 states and 1194 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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-16 21:54:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:39,165 INFO L93 Difference]: Finished difference Result 1414 states and 1967 transitions. [2025-03-16 21:54:39,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:39,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-16 21:54:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:39,167 INFO L225 Difference]: With dead ends: 1414 [2025-03-16 21:54:39,167 INFO L226 Difference]: Without dead ends: 852 [2025-03-16 21:54:39,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-16 21:54:39,168 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 0 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:39,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1907 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-03-16 21:54:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2025-03-16 21:54:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.3772032902467686) internal successors, (1172), 851 states have internal predecessors, (1172), 0 states have call successors, (0), 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-16 21:54:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1172 transitions. [2025-03-16 21:54:39,174 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1172 transitions. Word has length 113 [2025-03-16 21:54:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:39,175 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1172 transitions. [2025-03-16 21:54:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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-16 21:54:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1172 transitions. [2025-03-16 21:54:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 21:54:39,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:39,175 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] [2025-03-16 21:54:39,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 21:54:39,176 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:39,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1710158046, now seen corresponding path program 1 times [2025-03-16 21:54:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:39,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636313522] [2025-03-16 21:54:39,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:39,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 21:54:39,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 21:54:39,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:39,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:54:39,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:54:39,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 21:54:39,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 21:54:39,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:54:39,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:54:39,394 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:54:39,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:54:39,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 21:54:39,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:39,464 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:54:39,494 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:54:39,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:54:39 BoogieIcfgContainer [2025-03-16 21:54:39,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:54:39,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:54:39,502 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:54:39,502 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:54:39,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:09" (3/4) ... [2025-03-16 21:54:39,504 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:54:39,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:54:39,505 INFO L158 Benchmark]: Toolchain (without parser) took 32427.04ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 103.1MB in the beginning and 354.8MB in the end (delta: -251.7MB). Peak memory consumption was 253.3MB. Max. memory is 16.1GB. [2025-03-16 21:54:39,505 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:54:39,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.68ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 51.7MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 21:54:39,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 186.33ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 71.1MB in the end (delta: -20.5MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-03-16 21:54:39,506 INFO L158 Benchmark]: Boogie Preprocessor took 190.28ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 42.9MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 21:54:39,506 INFO L158 Benchmark]: IcfgBuilder took 1785.60ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 42.2MB in the beginning and 81.1MB in the end (delta: -38.8MB). Peak memory consumption was 155.1MB. Max. memory is 16.1GB. [2025-03-16 21:54:39,506 INFO L158 Benchmark]: TraceAbstraction took 29714.43ms. Allocated memory was 318.8MB in the beginning and 645.9MB in the end (delta: 327.2MB). Free memory was 80.4MB in the beginning and 354.8MB in the end (delta: -274.5MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-03-16 21:54:39,506 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 645.9MB. Free memory was 354.8MB in the beginning and 354.8MB in the end (delta: 55.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:54:39,507 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.15ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.68ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 51.7MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 186.33ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 71.1MB in the end (delta: -20.5MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 190.28ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 42.9MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1785.60ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 42.2MB in the beginning and 81.1MB in the end (delta: -38.8MB). Peak memory consumption was 155.1MB. Max. memory is 16.1GB. * TraceAbstraction took 29714.43ms. Allocated memory was 318.8MB in the beginning and 645.9MB in the end (delta: 327.2MB). Free memory was 80.4MB in the beginning and 354.8MB in the end (delta: -274.5MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 645.9MB. Free memory was 354.8MB in the beginning and 354.8MB in the end (delta: 55.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 371, overapproximation of bitwiseOr at line 337, overapproximation of bitwiseOr at line 313, overapproximation of bitwiseOr at line 397, overapproximation of bitwiseAnd at line 437. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 2); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (2 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 4); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (4 - 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_10 var_11 = 0; [L39] const SORT_1 var_14 = 0; [L40] const SORT_4 var_16 = 0; [L41] const SORT_9 var_33 = 8; [L42] const SORT_9 var_40 = 7; [L43] const SORT_4 var_52 = 1; [L44] const SORT_1 var_56 = 1; [L45] const SORT_4 var_66 = 2; [L46] const SORT_9 var_72 = 0; [L47] const SORT_4 var_79 = 3; [L48] const SORT_9 var_98 = 5; [L49] const SORT_10 var_120 = 1; [L50] const SORT_9 var_122 = 15; [L51] const SORT_9 var_150 = 6; [L52] const SORT_9 var_315 = 1; [L54] SORT_1 input_2; [L55] SORT_1 input_3; [L56] SORT_4 input_5; [L57] SORT_1 input_6; [L58] SORT_1 input_7; [L59] SORT_1 input_8; [L60] SORT_4 input_103; [L61] SORT_10 input_116; [L62] SORT_10 input_117; [L63] SORT_10 input_118; [L64] SORT_10 input_119; [L65] SORT_10 input_128; [L66] SORT_10 input_135; [L67] SORT_10 input_142; [L68] SORT_10 input_143; [L69] SORT_10 input_144; [L70] SORT_10 input_149; [L71] SORT_10 input_153; [L72] SORT_10 input_159; [L73] SORT_4 input_174; [L74] SORT_4 input_175; [L75] SORT_4 input_176; [L76] SORT_4 input_177; [L77] SORT_4 input_184; [L78] SORT_4 input_187; [L79] SORT_4 input_195; [L80] SORT_4 input_202; [L81] SORT_4 input_203; [L82] SORT_4 input_204; [L83] SORT_4 input_207; [L84] SORT_4 input_209; [L85] SORT_4 input_214; [L86] SORT_4 input_223; [L87] SORT_1 input_235; [L88] SORT_1 input_236; [L89] SORT_1 input_237; [L90] SORT_1 input_238; [L91] SORT_1 input_245; [L92] SORT_1 input_248; [L93] SORT_1 input_251; [L94] SORT_1 input_261; [L95] SORT_4 input_276; [L96] SORT_4 input_280; [L97] SORT_4 input_281; [L98] SORT_4 input_282; [L99] SORT_4 input_283; [L100] SORT_4 input_287; [L101] SORT_4 input_292; [L102] SORT_4 input_301; [L103] SORT_9 input_311; [L104] SORT_9 input_312; [L105] SORT_9 input_313; [L106] SORT_9 input_314; [L107] SORT_9 input_320; [L108] SORT_9 input_326; [L109] SORT_9 input_333; [L110] SORT_9 input_334; [L111] SORT_9 input_335; [L112] SORT_9 input_338; [L113] SORT_9 input_340; [L114] SORT_9 input_344; [L115] SORT_9 input_345; [L116] SORT_9 input_349; [L117] SORT_9 input_354; [L118] SORT_9 input_372; [L119] SORT_9 input_373; [L120] SORT_9 input_374; [L121] SORT_9 input_375; [L122] SORT_9 input_380; [L123] SORT_9 input_383; [L124] SORT_9 input_391; [L125] SORT_9 input_398; [L126] SORT_9 input_399; [L127] SORT_9 input_400; [L128] SORT_9 input_403; [L129] SORT_9 input_405; [L130] SORT_9 input_410; [L131] SORT_9 input_419; [L132] SORT_9 input_430; [L133] SORT_9 input_431; [L134] SORT_9 input_432; [L135] SORT_9 input_433; [L136] SORT_9 input_438; [L137] SORT_9 input_441; [L138] SORT_9 input_444; [L139] SORT_9 input_454; [L141] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L141] SORT_10 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L142] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L142] SORT_4 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L143] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L143] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L144] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L144] SORT_4 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L145] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L145] SORT_9 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L146] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L146] SORT_4 state_96 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L147] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L147] SORT_9 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L148] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L148] SORT_9 state_113 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L150] SORT_10 init_13_arg_1 = var_11; [L151] state_12 = init_13_arg_1 [L152] SORT_4 init_18_arg_1 = var_16; [L153] state_17 = init_18_arg_1 [L154] SORT_1 init_23_arg_1 = var_14; [L155] state_22 = init_23_arg_1 [L156] SORT_4 init_51_arg_1 = var_16; [L157] state_50 = init_51_arg_1 [L158] SORT_9 init_74_arg_1 = var_72; [L159] state_73 = init_74_arg_1 [L160] SORT_9 init_112_arg_1 = var_72; [L161] state_111 = init_112_arg_1 [L162] SORT_9 init_114_arg_1 = var_72; [L163] state_113 = init_114_arg_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L166] input_2 = __VERIFIER_nondet_uchar() [L167] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L167] input_2 = input_2 & mask_SORT_1 [L168] input_3 = __VERIFIER_nondet_uchar() [L169] input_5 = __VERIFIER_nondet_uchar() [L170] input_6 = __VERIFIER_nondet_uchar() [L171] EXPR input_6 & mask_SORT_1 VAL [input_2=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L171] input_6 = input_6 & mask_SORT_1 [L172] input_7 = __VERIFIER_nondet_uchar() [L173] EXPR input_7 & mask_SORT_1 VAL [input_2=0, input_6=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L173] input_7 = input_7 & mask_SORT_1 [L174] input_8 = __VERIFIER_nondet_uchar() [L175] EXPR input_8 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L175] input_8 = input_8 & mask_SORT_1 [L176] input_103 = __VERIFIER_nondet_uchar() [L177] input_116 = __VERIFIER_nondet_uchar() [L178] input_117 = __VERIFIER_nondet_uchar() [L179] input_118 = __VERIFIER_nondet_uchar() [L180] input_119 = __VERIFIER_nondet_uchar() [L181] input_128 = __VERIFIER_nondet_uchar() [L182] input_135 = __VERIFIER_nondet_uchar() [L183] input_142 = __VERIFIER_nondet_uchar() [L184] input_143 = __VERIFIER_nondet_uchar() [L185] input_144 = __VERIFIER_nondet_uchar() [L186] input_149 = __VERIFIER_nondet_uchar() [L187] input_153 = __VERIFIER_nondet_uchar() [L188] input_159 = __VERIFIER_nondet_uchar() [L189] input_174 = __VERIFIER_nondet_uchar() [L190] input_175 = __VERIFIER_nondet_uchar() [L191] input_176 = __VERIFIER_nondet_uchar() [L192] input_177 = __VERIFIER_nondet_uchar() [L193] input_184 = __VERIFIER_nondet_uchar() [L194] input_187 = __VERIFIER_nondet_uchar() [L195] input_195 = __VERIFIER_nondet_uchar() [L196] input_202 = __VERIFIER_nondet_uchar() [L197] input_203 = __VERIFIER_nondet_uchar() [L198] input_204 = __VERIFIER_nondet_uchar() [L199] input_207 = __VERIFIER_nondet_uchar() [L200] input_209 = __VERIFIER_nondet_uchar() [L201] input_214 = __VERIFIER_nondet_uchar() [L202] input_223 = __VERIFIER_nondet_uchar() [L203] input_235 = __VERIFIER_nondet_uchar() [L204] input_236 = __VERIFIER_nondet_uchar() [L205] input_237 = __VERIFIER_nondet_uchar() [L206] input_238 = __VERIFIER_nondet_uchar() [L207] input_245 = __VERIFIER_nondet_uchar() [L208] input_248 = __VERIFIER_nondet_uchar() [L209] input_251 = __VERIFIER_nondet_uchar() [L210] input_261 = __VERIFIER_nondet_uchar() [L211] input_276 = __VERIFIER_nondet_uchar() [L212] input_280 = __VERIFIER_nondet_uchar() [L213] input_281 = __VERIFIER_nondet_uchar() [L214] input_282 = __VERIFIER_nondet_uchar() [L215] input_283 = __VERIFIER_nondet_uchar() [L216] input_287 = __VERIFIER_nondet_uchar() [L217] input_292 = __VERIFIER_nondet_uchar() [L218] input_301 = __VERIFIER_nondet_uchar() [L219] input_311 = __VERIFIER_nondet_uchar() [L220] input_312 = __VERIFIER_nondet_uchar() [L221] input_313 = __VERIFIER_nondet_uchar() [L222] input_314 = __VERIFIER_nondet_uchar() [L223] input_320 = __VERIFIER_nondet_uchar() [L224] input_326 = __VERIFIER_nondet_uchar() [L225] input_333 = __VERIFIER_nondet_uchar() [L226] input_334 = __VERIFIER_nondet_uchar() [L227] input_335 = __VERIFIER_nondet_uchar() [L228] input_338 = __VERIFIER_nondet_uchar() [L229] input_340 = __VERIFIER_nondet_uchar() [L230] input_344 = __VERIFIER_nondet_uchar() [L231] input_345 = __VERIFIER_nondet_uchar() [L232] input_349 = __VERIFIER_nondet_uchar() [L233] input_354 = __VERIFIER_nondet_uchar() [L234] input_372 = __VERIFIER_nondet_uchar() [L235] input_373 = __VERIFIER_nondet_uchar() [L236] input_374 = __VERIFIER_nondet_uchar() [L237] input_375 = __VERIFIER_nondet_uchar() [L238] input_380 = __VERIFIER_nondet_uchar() [L239] input_383 = __VERIFIER_nondet_uchar() [L240] input_391 = __VERIFIER_nondet_uchar() [L241] input_398 = __VERIFIER_nondet_uchar() [L242] input_399 = __VERIFIER_nondet_uchar() [L243] input_400 = __VERIFIER_nondet_uchar() [L244] input_403 = __VERIFIER_nondet_uchar() [L245] input_405 = __VERIFIER_nondet_uchar() [L246] input_410 = __VERIFIER_nondet_uchar() [L247] input_419 = __VERIFIER_nondet_uchar() [L248] input_430 = __VERIFIER_nondet_uchar() [L249] input_431 = __VERIFIER_nondet_uchar() [L250] input_432 = __VERIFIER_nondet_uchar() [L251] input_433 = __VERIFIER_nondet_uchar() [L252] input_438 = __VERIFIER_nondet_uchar() [L253] input_441 = __VERIFIER_nondet_uchar() [L254] input_444 = __VERIFIER_nondet_uchar() [L255] input_454 = __VERIFIER_nondet_uchar() [L258] SORT_1 var_15_arg_0 = var_14; [L259] SORT_10 var_15_arg_1 = state_12; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L260] EXPR ((SORT_9)var_15_arg_0 << 3) | var_15_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L260] SORT_9 var_15 = ((SORT_9)var_15_arg_0 << 3) | var_15_arg_1; [L261] SORT_4 var_19_arg_0 = state_17; [L262] SORT_1 var_19_arg_1 = var_14; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_19_arg_0=0, var_19_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L263] EXPR ((SORT_10)var_19_arg_0 << 1) | var_19_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L263] SORT_10 var_19 = ((SORT_10)var_19_arg_0 << 1) | var_19_arg_1; [L264] EXPR var_19 & mask_SORT_10 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L264] var_19 = var_19 & mask_SORT_10 [L265] SORT_1 var_20_arg_0 = var_14; [L266] SORT_10 var_20_arg_1 = var_19; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_20_arg_0=0, var_20_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L267] EXPR ((SORT_9)var_20_arg_0 << 3) | var_20_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L267] SORT_9 var_20 = ((SORT_9)var_20_arg_0 << 3) | var_20_arg_1; [L268] SORT_9 var_21_arg_0 = var_15; [L269] SORT_9 var_21_arg_1 = var_20; [L270] SORT_9 var_21 = var_21_arg_0 + var_21_arg_1; [L271] SORT_1 var_24_arg_0 = var_14; [L272] SORT_1 var_24_arg_1 = state_22; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_24_arg_0=0, var_24_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L273] EXPR ((SORT_4)var_24_arg_0 << 1) | var_24_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L273] SORT_4 var_24 = ((SORT_4)var_24_arg_0 << 1) | var_24_arg_1; [L274] EXPR var_24 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L274] var_24 = var_24 & mask_SORT_4 [L275] SORT_1 var_25_arg_0 = state_22; [L276] SORT_4 var_25_arg_1 = var_24; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_25_arg_0=0, var_25_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L277] EXPR ((SORT_10)var_25_arg_0 << 2) | var_25_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L277] SORT_10 var_25 = ((SORT_10)var_25_arg_0 << 2) | var_25_arg_1; [L278] EXPR var_25 & mask_SORT_10 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L278] var_25 = var_25 & mask_SORT_10 [L279] SORT_1 var_26_arg_0 = var_14; [L280] SORT_10 var_26_arg_1 = var_25; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_26_arg_0=0, var_26_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L281] EXPR ((SORT_9)var_26_arg_0 << 3) | var_26_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L281] SORT_9 var_26 = ((SORT_9)var_26_arg_0 << 3) | var_26_arg_1; [L282] SORT_9 var_27_arg_0 = var_21; [L283] SORT_9 var_27_arg_1 = var_26; [L284] SORT_9 var_27 = var_27_arg_0 + var_27_arg_1; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L285] EXPR var_27 & mask_SORT_9 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L285] var_27 = var_27 & mask_SORT_9 [L286] SORT_9 var_28_arg_0 = var_27; [L287] SORT_1 var_28 = var_28_arg_0 >> 3; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L288] EXPR var_28 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L288] var_28 = var_28 & mask_SORT_1 [L289] SORT_1 var_29_arg_0 = var_28; [L290] SORT_1 var_29_arg_1 = var_14; [L291] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L292] SORT_9 var_30_arg_0 = var_27; [L293] SORT_4 var_30 = var_30_arg_0 >> 1; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_29=1, var_30=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L294] EXPR var_30 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_29=1, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L294] var_30 = var_30 & mask_SORT_4 [L295] SORT_4 var_31_arg_0 = var_30; [L296] SORT_4 var_31_arg_1 = var_16; [L297] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L298] SORT_1 var_32_arg_0 = var_29; [L299] SORT_1 var_32_arg_1 = var_31; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32_arg_0=1, var_32_arg_1=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L300] EXPR var_32_arg_0 | var_32_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L300] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L301] SORT_9 var_34_arg_0 = var_27; [L302] SORT_9 var_34_arg_1 = var_33; [L303] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L304] SORT_1 var_35_arg_0 = var_34; [L305] SORT_1 var_35 = ~var_35_arg_0; [L306] SORT_10 var_36_arg_0 = state_12; [L307] SORT_10 var_36_arg_1 = var_11; [L308] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L309] SORT_1 var_37_arg_0 = var_36; [L310] SORT_1 var_37 = ~var_37_arg_0; [L311] SORT_1 var_38_arg_0 = var_35; [L312] SORT_1 var_38_arg_1 = var_37; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32=1, var_33=8, var_38_arg_0=-1, var_38_arg_1=-2, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L313] EXPR var_38_arg_0 | var_38_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L313] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L314] SORT_1 var_39_arg_0 = var_32; [L315] SORT_1 var_39_arg_1 = var_38; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39_arg_0=1, var_39_arg_1=256, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L316] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L316] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L317] SORT_9 var_41_arg_0 = var_27; [L318] SORT_9 var_41_arg_1 = var_40; [L319] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L320] SORT_1 var_42_arg_0 = var_41; [L321] SORT_1 var_42 = ~var_42_arg_0; [L322] SORT_10 var_43_arg_0 = state_12; [L323] SORT_10 var_43_arg_1 = var_11; [L324] SORT_1 var_43 = var_43_arg_0 == var_43_arg_1; [L325] SORT_1 var_44_arg_0 = var_43; [L326] SORT_1 var_44 = ~var_44_arg_0; [L327] SORT_4 var_45_arg_0 = state_17; [L328] SORT_4 var_45_arg_1 = var_16; [L329] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L330] SORT_1 var_46_arg_0 = var_45; [L331] SORT_1 var_46 = ~var_46_arg_0; [L332] SORT_1 var_47_arg_0 = var_44; [L333] SORT_1 var_47_arg_1 = var_46; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_42=-1, var_47_arg_0=-2, var_47_arg_1=-2, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L334] EXPR var_47_arg_0 | var_47_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_42=-1, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L334] SORT_1 var_47 = var_47_arg_0 | var_47_arg_1; [L335] SORT_1 var_48_arg_0 = var_42; [L336] SORT_1 var_48_arg_1 = var_47; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_48_arg_0=-1, var_48_arg_1=254, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L337] EXPR var_48_arg_0 | var_48_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L337] SORT_1 var_48 = var_48_arg_0 | var_48_arg_1; [L338] SORT_1 var_49_arg_0 = var_39; [L339] SORT_1 var_49_arg_1 = var_48; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49_arg_0=0, var_49_arg_1=256, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L340] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L340] SORT_1 var_49 = var_49_arg_0 & var_49_arg_1; [L341] SORT_4 var_53_arg_0 = state_50; [L342] SORT_4 var_53_arg_1 = var_52; [L343] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L344] SORT_9 var_54_arg_0 = var_27; [L345] SORT_9 var_54_arg_1 = var_40; [L346] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L347] SORT_1 var_55_arg_0 = var_53; [L348] SORT_1 var_55_arg_1 = var_54; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_55_arg_0=0, var_55_arg_1=0, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L349] EXPR var_55_arg_0 & var_55_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L349] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L350] SORT_1 var_57_arg_0 = var_28; [L351] SORT_1 var_57_arg_1 = var_56; [L352] SORT_1 var_57 = var_57_arg_0 == var_57_arg_1; [L353] SORT_1 var_58_arg_0 = var_55; [L354] SORT_1 var_58_arg_1 = var_57; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_58_arg_0=0, var_58_arg_1=0, var_66=2, var_72=0, var_79=3, var_98=5] [L355] EXPR var_58_arg_0 | var_58_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L355] SORT_1 var_58 = var_58_arg_0 | var_58_arg_1; [L356] SORT_1 var_59_arg_0 = var_58; [L357] SORT_1 var_59 = ~var_59_arg_0; [L358] SORT_10 var_60_arg_0 = state_12; [L359] SORT_10 var_60_arg_1 = var_11; [L360] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L361] SORT_4 var_61_arg_0 = state_17; [L362] SORT_4 var_61_arg_1 = var_16; [L363] SORT_1 var_61 = var_61_arg_0 == var_61_arg_1; [L364] SORT_1 var_62_arg_0 = var_60; [L365] SORT_1 var_62_arg_1 = var_61; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_59=-1, var_62_arg_0=1, var_62_arg_1=1, var_66=2, var_72=0, var_79=3, var_98=5] [L366] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_59=-1, var_66=2, var_72=0, var_79=3, var_98=5] [L366] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L367] SORT_1 var_63_arg_0 = var_62; [L368] SORT_1 var_63 = ~var_63_arg_0; [L369] SORT_1 var_64_arg_0 = var_59; [L370] SORT_1 var_64_arg_1 = var_63; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_64_arg_0=-1, var_64_arg_1=-2, var_66=2, var_72=0, var_79=3, var_98=5] [L371] EXPR var_64_arg_0 | var_64_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L371] SORT_1 var_64 = var_64_arg_0 | var_64_arg_1; [L372] SORT_1 var_65_arg_0 = var_49; [L373] SORT_1 var_65_arg_1 = var_64; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65_arg_0=0, var_65_arg_1=256, var_66=2, var_72=0, var_79=3, var_98=5] [L374] EXPR var_65_arg_0 & var_65_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L374] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L375] SORT_4 var_67_arg_0 = state_50; [L376] SORT_4 var_67_arg_1 = var_66; [L377] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L378] SORT_1 var_68_arg_0 = var_67; [L379] SORT_1 var_68 = ~var_68_arg_0; [L380] SORT_1 var_69_arg_0 = state_22; [L381] SORT_1 var_69_arg_1 = var_14; [L382] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L383] SORT_10 var_70_arg_0 = state_12; [L384] SORT_10 var_70_arg_1 = var_11; [L385] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L386] SORT_1 var_71_arg_0 = var_69; [L387] SORT_1 var_71_arg_1 = var_70; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_71_arg_0=1, var_71_arg_1=1, var_72=0, var_79=3, var_98=5] [L388] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_79=3, var_98=5] [L388] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L389] SORT_9 var_75_arg_0 = state_73; [L390] SORT_9 var_75_arg_1 = var_72; [L391] SORT_1 var_75 = var_75_arg_0 == var_75_arg_1; [L392] SORT_1 var_76_arg_0 = var_71; [L393] SORT_1 var_76_arg_1 = var_75; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_76_arg_0=1, var_76_arg_1=1, var_79=3, var_98=5] [L394] EXPR var_76_arg_0 & var_76_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_79=3, var_98=5] [L394] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L395] SORT_1 var_77_arg_0 = var_68; [L396] SORT_1 var_77_arg_1 = var_76; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_72=0, var_77_arg_0=-1, var_77_arg_1=1, var_79=3, var_98=5] [L397] EXPR var_77_arg_0 | var_77_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_72=0, var_79=3, var_98=5] [L397] SORT_1 var_77 = var_77_arg_0 | var_77_arg_1; [L398] SORT_1 var_78_arg_0 = var_65; [L399] SORT_1 var_78_arg_1 = var_77; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78_arg_0=0, var_78_arg_1=256, var_79=3, var_98=5] [L400] EXPR var_78_arg_0 & var_78_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L400] SORT_1 var_78 = var_78_arg_0 & var_78_arg_1; [L401] SORT_4 var_80_arg_0 = state_50; [L402] SORT_4 var_80_arg_1 = var_79; [L403] SORT_1 var_80 = var_80_arg_0 == var_80_arg_1; [L404] SORT_1 var_81_arg_0 = var_80; [L405] SORT_1 var_81 = ~var_81_arg_0; [L406] SORT_9 var_82_arg_0 = var_27; [L407] SORT_4 var_82 = var_82_arg_0 >> 2; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_82=0, var_98=5] [L408] EXPR var_82 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_98=5] [L408] var_82 = var_82 & mask_SORT_4 [L409] SORT_4 var_83_arg_0 = var_82; [L410] SORT_4 var_83_arg_1 = var_52; [L411] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L412] SORT_9 var_84_arg_0 = var_27; [L413] SORT_4 var_84 = var_84_arg_0 >> 0; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_84=0, var_98=5] [L414] EXPR var_84 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_98=5] [L414] var_84 = var_84 & mask_SORT_4 [L415] SORT_4 var_85_arg_0 = var_84; [L416] SORT_4 var_85_arg_1 = var_52; [L417] SORT_1 var_85 = var_85_arg_0 == var_85_arg_1; [L418] SORT_4 var_86_arg_0 = var_84; [L419] SORT_4 var_86_arg_1 = var_66; [L420] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L421] SORT_1 var_87_arg_0 = var_85; [L422] SORT_1 var_87_arg_1 = var_86; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_87_arg_0=0, var_87_arg_1=0, var_98=5] [L423] EXPR var_87_arg_0 | var_87_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_98=5] [L423] SORT_1 var_87 = var_87_arg_0 | var_87_arg_1; [L424] SORT_1 var_88_arg_0 = var_83; [L425] SORT_1 var_88_arg_1 = var_87; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_88_arg_0=0, var_88_arg_1=0, var_98=5] [L426] EXPR var_88_arg_0 & var_88_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_98=5] [L426] SORT_1 var_88 = var_88_arg_0 & var_88_arg_1; [L427] SORT_1 var_89_arg_0 = var_81; [L428] SORT_1 var_89_arg_1 = var_88; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_89_arg_0=-1, var_89_arg_1=0, var_98=5] [L429] EXPR var_89_arg_0 | var_89_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_98=5] [L429] SORT_1 var_89 = var_89_arg_0 | var_89_arg_1; [L430] SORT_1 var_90_arg_0 = var_78; [L431] SORT_1 var_90_arg_1 = var_89; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_90_arg_0=0, var_90_arg_1=255, var_98=5] [L432] EXPR var_90_arg_0 & var_90_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L432] SORT_1 var_90 = var_90_arg_0 & var_90_arg_1; [L433] SORT_1 var_93_arg_0 = var_90; [L434] SORT_1 var_93 = ~var_93_arg_0; [L435] SORT_1 var_94_arg_0 = var_56; [L436] SORT_1 var_94_arg_1 = var_93; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_94_arg_0=1, var_94_arg_1=-1, var_98=5] [L437] EXPR var_94_arg_0 & var_94_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L437] SORT_1 var_94 = var_94_arg_0 & var_94_arg_1; [L438] EXPR var_94 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L438] var_94 = var_94 & mask_SORT_1 [L439] SORT_1 bad_95_arg_0 = var_94; [L440] CALL __VERIFIER_assert(!(bad_95_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 324 locations, 483 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.5s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16986 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16986 mSDsluCounter, 67504 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52610 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19545 IncrementalHoareTripleChecker+Invalid, 19572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 14894 mSDtfsCounter, 19545 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=874occurred in iteration=36, InterpolantAutomatonStates: 243, 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, 38 MinimizatonAttempts, 2921 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 4162 NumberOfCodeBlocks, 4162 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4011 ConstructedInterpolants, 0 QuantifiedInterpolants, 12252 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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-16 21:54:39,532 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.h_Vending.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 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:54:41,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:54:41,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:54:41,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:54:41,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:54:41,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:54:41,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:54:41,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:54:41,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:54:41,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:54:41,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:54:41,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:54:41,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:54:41,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:54:41,403 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:54:41,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:54:41,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:41,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:54:41,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:54:41,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:54:41,405 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:54:41,405 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:54:41,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:54:41,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:54:41,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:54:41,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:54:41,405 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 -> 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 [2025-03-16 21:54:41,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:54:41,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:54:41,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:54:41,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:54:41,629 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:54:41,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2025-03-16 21:54:42,763 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe7aa624/a5086136b65c42d288f7d9352edce9a9/FLAGec1c6cb9a [2025-03-16 21:54:43,040 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:54:43,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2025-03-16 21:54:43,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe7aa624/a5086136b65c42d288f7d9352edce9a9/FLAGec1c6cb9a [2025-03-16 21:54:43,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe7aa624/a5086136b65c42d288f7d9352edce9a9 [2025-03-16 21:54:43,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:54:43,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:54:43,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:43,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:54:43,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:54:43,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c795b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43, skipping insertion in model container [2025-03-16 21:54:43,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:54:43,526 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.h_Vending.c[1249,1262] [2025-03-16 21:54:43,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:43,694 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:54:43,700 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.h_Vending.c[1249,1262] [2025-03-16 21:54:43,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:43,777 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:54:43,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43 WrapperNode [2025-03-16 21:54:43,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:43,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:43,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:54:43,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:54:43,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,880 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1585 [2025-03-16 21:54:43,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:43,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:54:43,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:54:43,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:54:43,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,931 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-16 21:54:43,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:54:43,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:54:43,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:54:43,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:54:43,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (1/1) ... [2025-03-16 21:54:43,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:44,014 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-16 21:54:44,017 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-16 21:54:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:54:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:54:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:54:44,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:54:44,300 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:54:44,302 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:54:45,017 INFO L? ?]: Removed 270 outVars from TransFormulas that were not future-live. [2025-03-16 21:54:45,017 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:54:45,023 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:54:45,024 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:54:45,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:45 BoogieIcfgContainer [2025-03-16 21:54:45,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:54:45,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:54:45,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:54:45,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:54:45,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:54:43" (1/3) ... [2025-03-16 21:54:45,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b56586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:45, skipping insertion in model container [2025-03-16 21:54:45,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:43" (2/3) ... [2025-03-16 21:54:45,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b56586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:45, skipping insertion in model container [2025-03-16 21:54:45,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:45" (3/3) ... [2025-03-16 21:54:45,034 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vending.c [2025-03-16 21:54:45,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:54:45,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Vending.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:54:45,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:54:45,081 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;@170e97a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:54:45,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:54:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:54:45,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:45,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:54:45,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:45,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:45,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:54:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:54:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000193108] [2025-03-16 21:54:45,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:45,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:45,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:45,113 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-16 21:54:45,114 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-16 21:54:45,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:54:45,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:54:45,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:45,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:45,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-03-16 21:54:45,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:46,878 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-16 21:54:46,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:54:46,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:54:46,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000193108] [2025-03-16 21:54:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000193108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:46,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:46,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:54:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352367379] [2025-03-16 21:54:46,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:46,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:54:46,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:46,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:46,898 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:47,007 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:54:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:47,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-16 21:54:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:47,015 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:54:47,015 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:54:47,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:47,019 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:47,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:54:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:54:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:54:47,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:54:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:47,038 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:54:47,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:54:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:54:47,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:47,039 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:54:47,047 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-16 21:54:47,239 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-16 21:54:47,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:54:47,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:54:47,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760031529] [2025-03-16 21:54:47,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:47,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:47,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:47,244 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-16 21:54:47,246 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-16 21:54:47,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:54:47,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:54:47,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:47,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:47,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 173 conjuncts are in the unsatisfiable core [2025-03-16 21:54:47,744 INFO L279 TraceCheckSpWp]: Computing forward predicates...