./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:12:48,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:12:48,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:12:48,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:12:48,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:12:48,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:12:48,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:12:48,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:12:48,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:12:48,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:12:48,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:12:48,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:12:48,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:12:48,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:12:48,104 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:12:48,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:12:48,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:12:48,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:12:48,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:12:48,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:12:48,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:12:48,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:12:48,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:12:48,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:12:48,105 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:12:48,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:12:48,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:12:48,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:12:48,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:12:48,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:48,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:12:48,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:12:48,106 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:12:48,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:12:48,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:12:48,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:12:48,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:12:48,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:12:48,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:12:48,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:12:48,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 [2025-02-08 00:12:48,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:12:48,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:12:48,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:12:48,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:12:48,360 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:12:48,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-02-08 00:12:49,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1729ec443/eb6d7ef4b9f44cfbb80cc7361d368810/FLAGc87d29bbb [2025-02-08 00:12:49,899 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:12:49,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-02-08 00:12:49,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1729ec443/eb6d7ef4b9f44cfbb80cc7361d368810/FLAGc87d29bbb [2025-02-08 00:12:50,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1729ec443/eb6d7ef4b9f44cfbb80cc7361d368810 [2025-02-08 00:12:50,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:12:50,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:12:50,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:50,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:12:50,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:12:50,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:50,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153a86e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50, skipping insertion in model container [2025-02-08 00:12:50,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:50,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:12:50,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c[1260,1273] [2025-02-08 00:12:50,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:50,638 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:12:50,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c[1260,1273] [2025-02-08 00:12:50,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:50,825 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:12:50,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50 WrapperNode [2025-02-08 00:12:50,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:50,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:50,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:12:50,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:12:50,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:50,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,405 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4899 [2025-02-08 00:12:51,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:51,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:12:51,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:12:51,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:12:51,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,638 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:12:51,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:12:51,837 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:12:51,837 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:12:51,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:12:51,838 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (1/1) ... [2025-02-08 00:12:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:51,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:12:51,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:12:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:12:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:12:51,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:12:51,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:12:52,185 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:12:52,187 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:12:55,919 INFO L? ?]: Removed 2878 outVars from TransFormulas that were not future-live. [2025-02-08 00:12:55,920 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:12:56,060 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:12:56,060 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:12:56,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:56 BoogieIcfgContainer [2025-02-08 00:12:56,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:12:56,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:12:56,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:12:56,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:12:56,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:12:50" (1/3) ... [2025-02-08 00:12:56,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e0628e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:12:56, skipping insertion in model container [2025-02-08 00:12:56,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:50" (2/3) ... [2025-02-08 00:12:56,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e0628e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:12:56, skipping insertion in model container [2025-02-08 00:12:56,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:56" (3/3) ... [2025-02-08 00:12:56,067 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-02-08 00:12:56,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:12:56,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c that has 1 procedures, 1532 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:12:56,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:12:56,210 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;@2fb96f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:12:56,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:12:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 1532 states, 1530 states have (on average 1.5) internal successors, (2295), 1531 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 00:12:56,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:56,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:12:56,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1411832946, now seen corresponding path program 1 times [2025-02-08 00:12:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:56,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649206109] [2025-02-08 00:12:56,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:56,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 00:12:56,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 00:12:56,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:56,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649206109] [2025-02-08 00:12:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649206109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:56,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549773521] [2025-02-08 00:12:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:56,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:12:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:56,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:12:56,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:56,946 INFO L87 Difference]: Start difference. First operand has 1532 states, 1530 states have (on average 1.5) internal successors, (2295), 1531 states have internal predecessors, (2295), 0 states have call successors, (0), 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 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:57,675 INFO L93 Difference]: Finished difference Result 3015 states and 4519 transitions. [2025-02-08 00:12:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:12:57,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-02-08 00:12:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:57,699 INFO L225 Difference]: With dead ends: 3015 [2025-02-08 00:12:57,699 INFO L226 Difference]: Without dead ends: 1532 [2025-02-08 00:12:57,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:57,709 INFO L435 NwaCegarLoop]: 1909 mSDtfsCounter, 0 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5722 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:57,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5722 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:12:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-02-08 00:12:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2025-02-08 00:12:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.4983670803396474) internal successors, (2294), 1531 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2294 transitions. [2025-02-08 00:12:57,799 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2294 transitions. Word has length 46 [2025-02-08 00:12:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:57,799 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 2294 transitions. [2025-02-08 00:12:57,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2294 transitions. [2025-02-08 00:12:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 00:12:57,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:57,801 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] [2025-02-08 00:12:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:12:57,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:57,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -812466703, now seen corresponding path program 1 times [2025-02-08 00:12:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269562936] [2025-02-08 00:12:57,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:57,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 00:12:57,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 00:12:57,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:57,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269562936] [2025-02-08 00:12:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269562936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:58,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:58,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:12:58,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046701467] [2025-02-08 00:12:58,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:58,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:12:58,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:58,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:12:58,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:58,068 INFO L87 Difference]: Start difference. First operand 1532 states and 2294 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:12:58,731 INFO L93 Difference]: Finished difference Result 3017 states and 4518 transitions. [2025-02-08 00:12:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:12:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-02-08 00:12:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:12:58,736 INFO L225 Difference]: With dead ends: 3017 [2025-02-08 00:12:58,736 INFO L226 Difference]: Without dead ends: 1534 [2025-02-08 00:12:58,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:12:58,739 INFO L435 NwaCegarLoop]: 1909 mSDtfsCounter, 0 mSDsluCounter, 3810 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5719 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:12:58,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5719 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:12:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-02-08 00:12:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1534. [2025-02-08 00:12:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 1.4977168949771689) internal successors, (2296), 1533 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2296 transitions. [2025-02-08 00:12:58,770 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2296 transitions. Word has length 47 [2025-02-08 00:12:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:12:58,770 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 2296 transitions. [2025-02-08 00:12:58,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:12:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2296 transitions. [2025-02-08 00:12:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 00:12:58,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:12:58,771 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] [2025-02-08 00:12:58,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:12:58,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:12:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:12:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1780119575, now seen corresponding path program 1 times [2025-02-08 00:12:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:12:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829205238] [2025-02-08 00:12:58,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:12:58,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:12:58,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:12:58,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:12:58,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:12:58,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:12:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:12:59,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:12:59,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829205238] [2025-02-08 00:12:59,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829205238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:12:59,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:12:59,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:12:59,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845924413] [2025-02-08 00:12:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:12:59,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:12:59,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:12:59,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:12:59,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:12:59,248 INFO L87 Difference]: Start difference. First operand 1534 states and 2296 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:00,112 INFO L93 Difference]: Finished difference Result 3023 states and 4525 transitions. [2025-02-08 00:13:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:13:00,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-08 00:13:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:00,117 INFO L225 Difference]: With dead ends: 3023 [2025-02-08 00:13:00,118 INFO L226 Difference]: Without dead ends: 1538 [2025-02-08 00:13:00,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:00,120 INFO L435 NwaCegarLoop]: 1899 mSDtfsCounter, 2258 mSDsluCounter, 5689 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2258 SdHoareTripleChecker+Valid, 7588 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:00,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2258 Valid, 7588 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:13:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-02-08 00:13:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1537. [2025-02-08 00:13:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 1.4967447916666667) internal successors, (2299), 1536 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2299 transitions. [2025-02-08 00:13:00,147 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2299 transitions. Word has length 48 [2025-02-08 00:13:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:00,148 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2299 transitions. [2025-02-08 00:13:00,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2299 transitions. [2025-02-08 00:13:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 00:13:00,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:00,151 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] [2025-02-08 00:13:00,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:13:00,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:00,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1755734250, now seen corresponding path program 1 times [2025-02-08 00:13:00,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:00,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339580696] [2025-02-08 00:13:00,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:00,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:13:00,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:13:00,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:00,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:00,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339580696] [2025-02-08 00:13:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339580696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:13:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425819552] [2025-02-08 00:13:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:00,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:13:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:00,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:13:00,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:13:00,541 INFO L87 Difference]: Start difference. First operand 1537 states and 2299 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:01,850 INFO L93 Difference]: Finished difference Result 3037 states and 4543 transitions. [2025-02-08 00:13:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:13:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-02-08 00:13:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:01,856 INFO L225 Difference]: With dead ends: 3037 [2025-02-08 00:13:01,856 INFO L226 Difference]: Without dead ends: 1549 [2025-02-08 00:13:01,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:13:01,861 INFO L435 NwaCegarLoop]: 1897 mSDtfsCounter, 2272 mSDsluCounter, 11367 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 13264 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:01,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2272 Valid, 13264 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 00:13:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-02-08 00:13:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1544. [2025-02-08 00:13:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.4970836033700583) internal successors, (2310), 1543 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2310 transitions. [2025-02-08 00:13:01,887 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2310 transitions. Word has length 49 [2025-02-08 00:13:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:01,888 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2310 transitions. [2025-02-08 00:13:01,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2310 transitions. [2025-02-08 00:13:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 00:13:01,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:01,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] [2025-02-08 00:13:01,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:13:01,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1165488150, now seen corresponding path program 1 times [2025-02-08 00:13:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151956790] [2025-02-08 00:13:01,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:01,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:01,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:13:01,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:13:01,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:01,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:02,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-02-08 00:13:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:02,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151956790] [2025-02-08 00:13:02,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151956790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:02,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:02,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:13:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585478542] [2025-02-08 00:13:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:02,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:13:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:02,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:13:02,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:13:02,516 INFO L87 Difference]: Start difference. First operand 1544 states and 2310 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:03,569 INFO L93 Difference]: Finished difference Result 3068 states and 4590 transitions. [2025-02-08 00:13:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:13:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-02-08 00:13:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:03,575 INFO L225 Difference]: With dead ends: 3068 [2025-02-08 00:13:03,575 INFO L226 Difference]: Without dead ends: 1573 [2025-02-08 00:13:03,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:13:03,577 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2333 mSDsluCounter, 9484 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2333 SdHoareTripleChecker+Valid, 11382 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:03,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2333 Valid, 11382 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:13:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-02-08 00:13:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1567. [2025-02-08 00:13:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1566 states have (on average 1.496168582375479) internal successors, (2343), 1566 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2343 transitions. [2025-02-08 00:13:03,598 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2343 transitions. Word has length 49 [2025-02-08 00:13:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:03,598 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2343 transitions. [2025-02-08 00:13:03,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2343 transitions. [2025-02-08 00:13:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 00:13:03,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:03,599 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] [2025-02-08 00:13:03,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:13:03,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:03,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1774344130, now seen corresponding path program 1 times [2025-02-08 00:13:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:03,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220729930] [2025-02-08 00:13:03,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:03,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 00:13:03,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 00:13:03,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:03,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:04,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220729930] [2025-02-08 00:13:04,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220729930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:04,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:04,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 00:13:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784326500] [2025-02-08 00:13:04,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:04,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 00:13:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:04,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 00:13:04,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:13:04,233 INFO L87 Difference]: Start difference. First operand 1567 states and 2343 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:06,010 INFO L93 Difference]: Finished difference Result 3088 states and 4615 transitions. [2025-02-08 00:13:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:13:06,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-02-08 00:13:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:06,015 INFO L225 Difference]: With dead ends: 3088 [2025-02-08 00:13:06,015 INFO L226 Difference]: Without dead ends: 1585 [2025-02-08 00:13:06,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:13:06,018 INFO L435 NwaCegarLoop]: 1886 mSDtfsCounter, 2326 mSDsluCounter, 16952 mSDsCounter, 0 mSdLazyCounter, 4081 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 18838 SdHoareTripleChecker+Invalid, 4087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:06,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 18838 Invalid, 4087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 00:13:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-02-08 00:13:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1578. [2025-02-08 00:13:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.4946100190234624) internal successors, (2357), 1577 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2357 transitions. [2025-02-08 00:13:06,043 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2357 transitions. Word has length 50 [2025-02-08 00:13:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:06,043 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2357 transitions. [2025-02-08 00:13:06,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2357 transitions. [2025-02-08 00:13:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 00:13:06,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:06,045 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] [2025-02-08 00:13:06,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:13:06,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:06,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash -409543075, now seen corresponding path program 1 times [2025-02-08 00:13:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:06,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275463476] [2025-02-08 00:13:06,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:06,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:06,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 00:13:06,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 00:13:06,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:06,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:06,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:06,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275463476] [2025-02-08 00:13:06,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275463476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:06,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:06,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:06,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476447677] [2025-02-08 00:13:06,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:06,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:06,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:06,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:06,472 INFO L87 Difference]: Start difference. First operand 1578 states and 2357 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:07,113 INFO L93 Difference]: Finished difference Result 3095 states and 4623 transitions. [2025-02-08 00:13:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-02-08 00:13:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:07,117 INFO L225 Difference]: With dead ends: 3095 [2025-02-08 00:13:07,117 INFO L226 Difference]: Without dead ends: 1577 [2025-02-08 00:13:07,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:07,119 INFO L435 NwaCegarLoop]: 1905 mSDtfsCounter, 2292 mSDsluCounter, 3798 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2292 SdHoareTripleChecker+Valid, 5703 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:07,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2292 Valid, 5703 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-02-08 00:13:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2025-02-08 00:13:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1576 states have (on average 1.4936548223350254) internal successors, (2354), 1576 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2354 transitions. [2025-02-08 00:13:07,140 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2354 transitions. Word has length 50 [2025-02-08 00:13:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:07,141 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2354 transitions. [2025-02-08 00:13:07,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2354 transitions. [2025-02-08 00:13:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 00:13:07,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:07,141 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] [2025-02-08 00:13:07,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:13:07,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:07,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1433191074, now seen corresponding path program 1 times [2025-02-08 00:13:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:07,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246964232] [2025-02-08 00:13:07,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:07,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 00:13:07,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 00:13:07,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:07,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246964232] [2025-02-08 00:13:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246964232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730802104] [2025-02-08 00:13:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:07,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:07,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:07,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:07,510 INFO L87 Difference]: Start difference. First operand 1577 states and 2354 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:08,386 INFO L93 Difference]: Finished difference Result 3072 states and 4591 transitions. [2025-02-08 00:13:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:13:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-08 00:13:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:08,389 INFO L225 Difference]: With dead ends: 3072 [2025-02-08 00:13:08,389 INFO L226 Difference]: Without dead ends: 1565 [2025-02-08 00:13:08,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:13:08,391 INFO L435 NwaCegarLoop]: 1901 mSDtfsCounter, 2295 mSDsluCounter, 7592 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2295 SdHoareTripleChecker+Valid, 9493 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:08,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2295 Valid, 9493 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:13:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-02-08 00:13:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2025-02-08 00:13:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1564 states have (on average 1.4942455242966752) internal successors, (2337), 1564 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2337 transitions. [2025-02-08 00:13:08,410 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2337 transitions. Word has length 51 [2025-02-08 00:13:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2337 transitions. [2025-02-08 00:13:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2337 transitions. [2025-02-08 00:13:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 00:13:08,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:08,411 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] [2025-02-08 00:13:08,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:13:08,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:08,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1309327363, now seen corresponding path program 1 times [2025-02-08 00:13:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571401852] [2025-02-08 00:13:08,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:08,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 00:13:08,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 00:13:08,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:08,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:08,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:08,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571401852] [2025-02-08 00:13:08,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571401852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:08,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:08,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345199621] [2025-02-08 00:13:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:08,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:08,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:08,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:08,596 INFO L87 Difference]: Start difference. First operand 1565 states and 2337 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:09,284 INFO L93 Difference]: Finished difference Result 3066 states and 4584 transitions. [2025-02-08 00:13:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-08 00:13:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:09,289 INFO L225 Difference]: With dead ends: 3066 [2025-02-08 00:13:09,289 INFO L226 Difference]: Without dead ends: 1571 [2025-02-08 00:13:09,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-08 00:13:09,293 INFO L435 NwaCegarLoop]: 1907 mSDtfsCounter, 2256 mSDsluCounter, 3807 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2256 SdHoareTripleChecker+Valid, 5714 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:09,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2256 Valid, 5714 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-02-08 00:13:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2025-02-08 00:13:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 1.4936305732484076) internal successors, (2345), 1570 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2345 transitions. [2025-02-08 00:13:09,313 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2345 transitions. Word has length 52 [2025-02-08 00:13:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:09,313 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2345 transitions. [2025-02-08 00:13:09,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2345 transitions. [2025-02-08 00:13:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 00:13:09,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:09,314 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] [2025-02-08 00:13:09,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:13:09,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:09,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:09,317 INFO L85 PathProgramCache]: Analyzing trace with hash 801752728, now seen corresponding path program 1 times [2025-02-08 00:13:09,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:09,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310774123] [2025-02-08 00:13:09,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:09,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:09,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 00:13:09,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 00:13:09,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:09,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:13:09,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:13:09,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 00:13:09,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 00:13:09,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:09,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:13:09,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:13:09,484 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:13:09,485 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:13:09,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:13:09,490 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:09,531 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:13:09,550 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:13:09,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:13:09 BoogieIcfgContainer [2025-02-08 00:13:09,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:13:09,555 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:13:09,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:13:09,556 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:13:09,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:12:56" (3/4) ... [2025-02-08 00:13:09,558 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:13:09,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:13:09,559 INFO L158 Benchmark]: Toolchain (without parser) took 19405.24ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 111.9MB in the beginning and 252.5MB in the end (delta: -140.5MB). Peak memory consumption was 221.1MB. Max. memory is 16.1GB. [2025-02-08 00:13:09,560 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:13:09,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.47ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 87.7MB in the end (delta: 23.7MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2025-02-08 00:13:09,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 579.44ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 87.7MB in the beginning and 361.4MB in the end (delta: -273.7MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2025-02-08 00:13:09,561 INFO L158 Benchmark]: Boogie Preprocessor took 428.76ms. Allocated memory is still 494.9MB. Free memory was 361.4MB in the beginning and 324.7MB in the end (delta: 36.7MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2025-02-08 00:13:09,561 INFO L158 Benchmark]: IcfgBuilder took 4223.47ms. Allocated memory is still 494.9MB. Free memory was 324.7MB in the beginning and 93.6MB in the end (delta: 231.1MB). Peak memory consumption was 244.3MB. Max. memory is 16.1GB. [2025-02-08 00:13:09,562 INFO L158 Benchmark]: TraceAbstraction took 13492.89ms. Allocated memory was 494.9MB in the beginning and 503.3MB in the end (delta: 8.4MB). Free memory was 93.6MB in the beginning and 252.5MB in the end (delta: -158.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:13:09,562 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 503.3MB. Free memory was 252.5MB in the beginning and 252.5MB in the end (delta: 18.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:13:09,563 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.31ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.47ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 87.7MB in the end (delta: 23.7MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 579.44ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 87.7MB in the beginning and 361.4MB in the end (delta: -273.7MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 428.76ms. Allocated memory is still 494.9MB. Free memory was 361.4MB in the beginning and 324.7MB in the end (delta: 36.7MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * IcfgBuilder took 4223.47ms. Allocated memory is still 494.9MB. Free memory was 324.7MB in the beginning and 93.6MB in the end (delta: 231.1MB). Peak memory consumption was 244.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13492.89ms. Allocated memory was 494.9MB in the beginning and 503.3MB in the end (delta: 8.4MB). Free memory was 93.6MB in the beginning and 252.5MB in the end (delta: -158.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 503.3MB. Free memory was 252.5MB in the beginning and 252.5MB in the end (delta: 18.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 bitwiseAnd at line 228. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 12); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (12 - 1); [L29] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 1); [L30] const SORT_8 msb_SORT_8 = (SORT_8)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 4); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (4 - 1); [L35] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 3); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (3 - 1); [L38] const SORT_310 mask_SORT_310 = (SORT_310)-1 >> (sizeof(SORT_310) * 8 - 2); [L39] const SORT_310 msb_SORT_310 = (SORT_310)1 << (2 - 1); [L41] const SORT_314 mask_SORT_314 = (SORT_314)-1 >> (sizeof(SORT_314) * 8 - 5); [L42] const SORT_314 msb_SORT_314 = (SORT_314)1 << (5 - 1); [L44] const SORT_316 mask_SORT_316 = (SORT_316)-1 >> (sizeof(SORT_316) * 8 - 6); [L45] const SORT_316 msb_SORT_316 = (SORT_316)1 << (6 - 1); [L47] const SORT_318 mask_SORT_318 = (SORT_318)-1 >> (sizeof(SORT_318) * 8 - 7); [L48] const SORT_318 msb_SORT_318 = (SORT_318)1 << (7 - 1); [L50] const SORT_320 mask_SORT_320 = (SORT_320)-1 >> (sizeof(SORT_320) * 8 - 8); [L51] const SORT_320 msb_SORT_320 = (SORT_320)1 << (8 - 1); [L53] const SORT_322 mask_SORT_322 = (SORT_322)-1 >> (sizeof(SORT_322) * 8 - 9); [L54] const SORT_322 msb_SORT_322 = (SORT_322)1 << (9 - 1); [L56] const SORT_324 mask_SORT_324 = (SORT_324)-1 >> (sizeof(SORT_324) * 8 - 10); [L57] const SORT_324 msb_SORT_324 = (SORT_324)1 << (10 - 1); [L59] const SORT_326 mask_SORT_326 = (SORT_326)-1 >> (sizeof(SORT_326) * 8 - 11); [L60] const SORT_326 msb_SORT_326 = (SORT_326)1 << (11 - 1); [L62] const SORT_8 var_18 = 0; [L63] const SORT_22 var_23 = 0; [L64] const SORT_22 var_26 = 4; [L65] const SORT_22 var_29 = 5; [L66] const SORT_1 var_32 = 0; [L67] const SORT_1 var_35 = 2730; [L68] const SORT_8 var_42 = 1; [L69] const SORT_13 var_65 = 2; [L70] const SORT_13 var_70 = 9; [L71] const SORT_13 var_78 = 15; [L72] const SORT_13 var_83 = 1; [L73] const SORT_13 var_85 = 3; [L74] const SORT_13 var_88 = 5; [L75] const SORT_13 var_91 = 7; [L76] const SORT_13 var_94 = 11; [L77] const SORT_13 var_118 = 8; [L78] const SORT_13 var_122 = 10; [L79] const SORT_13 var_126 = 13; [L80] const SORT_13 var_137 = 4; [L81] const SORT_13 var_139 = 12; [L82] const SORT_13 var_142 = 14; [L83] const SORT_13 var_148 = 6; [L84] const SORT_13 var_175 = 0; [L85] const SORT_22 var_221 = 1; [L86] const SORT_1 var_250 = 4095; [L87] const SORT_1 var_580 = 1; [L88] const SORT_326 var_598 = 0; [L90] SORT_1 input_2; [L91] SORT_1 input_3; [L92] SORT_1 input_4; [L93] SORT_1 input_5; [L94] SORT_1 input_6; [L95] SORT_1 input_7; [L96] SORT_8 input_9; [L97] SORT_8 input_10; [L98] SORT_8 input_11; [L99] SORT_1 input_12; [L100] SORT_13 input_14; [L101] SORT_8 input_15; [L102] SORT_8 input_16; [L103] SORT_8 input_17; [L104] SORT_1 input_217; [L105] SORT_1 input_237; [L106] SORT_22 input_240; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L108] SORT_8 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_8; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_22 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L109] SORT_22 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_22; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L110] SORT_1 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L111] SORT_1 state_38 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L112] SORT_1 state_40 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L113] SORT_1 state_44 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L114] SORT_1 state_46 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L115] SORT_1 state_50 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L116] SORT_1 state_52 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L117] SORT_1 state_67 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_22 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L118] SORT_22 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_22; [L119] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L119] SORT_1 state_135 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L121] SORT_8 init_20_arg_1 = var_18; [L122] state_19 = init_20_arg_1 [L123] SORT_22 init_25_arg_1 = var_23; [L124] state_24 = init_25_arg_1 [L125] SORT_1 init_34_arg_1 = var_32; [L126] state_33 = init_34_arg_1 [L127] SORT_1 init_39_arg_1 = var_32; [L128] state_38 = init_39_arg_1 [L129] SORT_1 init_41_arg_1 = var_32; [L130] state_40 = init_41_arg_1 [L131] SORT_1 init_45_arg_1 = var_32; [L132] state_44 = init_45_arg_1 [L133] SORT_1 init_47_arg_1 = var_32; [L134] state_46 = init_47_arg_1 [L135] SORT_1 init_51_arg_1 = var_32; [L136] state_50 = init_51_arg_1 [L137] SORT_1 init_53_arg_1 = var_32; [L138] state_52 = init_53_arg_1 [L139] SORT_1 init_68_arg_1 = var_32; [L140] state_67 = init_68_arg_1 [L141] SORT_22 init_107_arg_1 = var_23; [L142] state_106 = init_107_arg_1 [L143] SORT_1 init_136_arg_1 = var_32; [L144] state_135 = init_136_arg_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L147] input_2 = __VERIFIER_nondet_ushort() [L148] input_3 = __VERIFIER_nondet_ushort() [L149] input_4 = __VERIFIER_nondet_ushort() [L150] input_5 = __VERIFIER_nondet_ushort() [L151] input_6 = __VERIFIER_nondet_ushort() [L152] input_7 = __VERIFIER_nondet_ushort() [L153] input_9 = __VERIFIER_nondet_uchar() [L154] input_10 = __VERIFIER_nondet_uchar() [L155] input_11 = __VERIFIER_nondet_uchar() [L156] EXPR input_11 & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L156] input_11 = input_11 & mask_SORT_8 [L157] input_12 = __VERIFIER_nondet_ushort() [L158] input_14 = __VERIFIER_nondet_uchar() [L159] EXPR input_14 & mask_SORT_13 VAL [input_11=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_19=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L159] input_14 = input_14 & mask_SORT_13 [L160] input_15 = __VERIFIER_nondet_uchar() [L161] input_16 = __VERIFIER_nondet_uchar() [L162] input_17 = __VERIFIER_nondet_uchar() [L163] input_217 = __VERIFIER_nondet_ushort() [L164] input_237 = __VERIFIER_nondet_ushort() [L165] input_240 = __VERIFIER_nondet_uchar() [L168] SORT_8 var_21_arg_0 = state_19; [L169] SORT_8 var_21_arg_1 = var_18; [L170] SORT_8 var_21 = var_21_arg_0 == var_21_arg_1; [L171] SORT_22 var_27_arg_0 = state_24; [L172] SORT_22 var_27_arg_1 = var_26; [L173] SORT_8 var_27 = var_27_arg_0 == var_27_arg_1; [L174] SORT_8 var_28_arg_0 = var_21; [L175] SORT_8 var_28_arg_1 = var_27; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_28_arg_0=1, var_28_arg_1=0, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L176] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_24=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L176] SORT_8 var_28 = var_28_arg_0 | var_28_arg_1; [L177] SORT_22 var_30_arg_0 = state_24; [L178] SORT_22 var_30_arg_1 = var_29; [L179] SORT_8 var_30 = var_30_arg_0 == var_30_arg_1; [L180] SORT_8 var_31_arg_0 = var_28; [L181] SORT_8 var_31_arg_1 = var_30; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_31_arg_0=1, var_31_arg_1=0, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L182] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_33=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L182] SORT_8 var_31 = var_31_arg_0 | var_31_arg_1; [L183] SORT_1 var_36_arg_0 = state_33; [L184] SORT_1 var_36_arg_1 = var_35; [L185] SORT_8 var_36 = var_36_arg_0 != var_36_arg_1; [L186] SORT_8 var_37_arg_0 = var_31; [L187] SORT_8 var_37_arg_1 = var_36; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37_arg_0=1, var_37_arg_1=1, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L188] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L188] SORT_8 var_37 = var_37_arg_0 | var_37_arg_1; [L189] SORT_8 var_55_arg_0 = var_42; [L190] SORT_1 var_55_arg_1 = input_7; [L191] SORT_1 var_55_arg_2 = input_6; [L192] SORT_1 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L193] SORT_8 var_54_arg_0 = var_42; [L194] SORT_1 var_54_arg_1 = state_52; [L195] SORT_1 var_54_arg_2 = state_50; [L196] SORT_1 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L197] SORT_8 var_56_arg_0 = var_18; [L198] SORT_1 var_56_arg_1 = var_55; [L199] SORT_1 var_56_arg_2 = var_54; [L200] SORT_1 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; [L201] SORT_8 var_48_arg_0 = var_42; [L202] SORT_1 var_48_arg_1 = state_46; [L203] SORT_1 var_48_arg_2 = state_44; [L204] SORT_1 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L205] SORT_8 var_43_arg_0 = var_42; [L206] SORT_1 var_43_arg_1 = state_40; [L207] SORT_1 var_43_arg_2 = state_38; [L208] SORT_1 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L209] SORT_8 var_49_arg_0 = var_18; [L210] SORT_1 var_49_arg_1 = var_48; [L211] SORT_1 var_49_arg_2 = var_43; [L212] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L213] SORT_8 var_57_arg_0 = var_42; [L214] SORT_1 var_57_arg_1 = var_56; [L215] SORT_1 var_57_arg_2 = var_49; [L216] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37=1, var_42=1, var_57=0, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L217] EXPR var_57 & mask_SORT_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_37=1, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L217] var_57 = var_57 & mask_SORT_1 [L218] SORT_1 var_58_arg_0 = var_57; [L219] SORT_1 var_58_arg_1 = var_35; [L220] SORT_8 var_58 = var_58_arg_0 == var_58_arg_1; [L221] SORT_8 var_59_arg_0 = var_37; [L222] SORT_8 var_59_arg_1 = var_58; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_59_arg_0=1, var_59_arg_1=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L223] EXPR var_59_arg_0 | var_59_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L223] SORT_8 var_59 = var_59_arg_0 | var_59_arg_1; [L224] SORT_8 var_62_arg_0 = var_59; [L225] SORT_8 var_62 = ~var_62_arg_0; [L226] SORT_8 var_63_arg_0 = var_42; [L227] SORT_8 var_63_arg_1 = var_62; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_63_arg_0=1, var_63_arg_1=-2, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L228] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L228] SORT_8 var_63 = var_63_arg_0 & var_63_arg_1; [L229] EXPR var_63 & mask_SORT_8 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_22=7, mask_SORT_310=3, mask_SORT_314=31, mask_SORT_316=63, mask_SORT_318=127, mask_SORT_320=255, mask_SORT_322=511, mask_SORT_324=1023, mask_SORT_326=2047, mask_SORT_8=1, state_106=0, state_135=0, state_38=0, state_40=0, state_44=0, state_46=0, state_50=0, state_52=0, state_67=0, var_118=8, var_122=10, var_126=13, var_137=4, var_139=12, var_142=14, var_148=6, var_175=0, var_18=0, var_221=1, var_23=0, var_250=4095, var_26=4, var_29=5, var_32=0, var_35=2730, var_42=1, var_580=1, var_598=0, var_65=2, var_70=9, var_78=15, var_83=1, var_85=3, var_88=5, var_91=7, var_94=11] [L229] var_63 = var_63 & mask_SORT_8 [L230] SORT_8 bad_64_arg_0 = var_63; [L231] CALL __VERIFIER_assert(!(bad_64_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1532 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16032 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16032 mSDsluCounter, 83423 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66312 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17443 IncrementalHoareTripleChecker+Invalid, 17453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 17111 mSDtfsCounter, 17443 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1578occurred in iteration=6, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 433 ConstructedInterpolants, 0 QuantifiedInterpolants, 1907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:13:09,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:13:11,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:13:11,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:13:11,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:13:11,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:13:11,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:13:11,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:13:11,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:13:11,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:13:11,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:13:11,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:13:11,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:13:11,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:13:11,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:13:11,589 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:13:11,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:13:11,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:13:11,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:13:11,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:13:11,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:13:11,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:13:11,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:13:11,590 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:13:11,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:13:11,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:13:11,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:13:11,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:13:11,591 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71117c9c67f985d05d0c9859b116d512376f478c1182a53aad610245b01d40e1 [2025-02-08 00:13:11,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:13:11,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:13:11,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:13:11,848 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:13:11,848 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:13:11,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-02-08 00:13:13,028 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c926a8022/9a8789f1be2f4bafb6a033e0ea630824/FLAGe88d4101a [2025-02-08 00:13:13,320 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:13:13,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-02-08 00:13:13,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c926a8022/9a8789f1be2f4bafb6a033e0ea630824/FLAGe88d4101a [2025-02-08 00:13:13,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c926a8022/9a8789f1be2f4bafb6a033e0ea630824 [2025-02-08 00:13:13,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:13:13,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:13:13,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:13:13,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:13:13,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:13:13,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:13:13" (1/1) ... [2025-02-08 00:13:13,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378bb902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:13, skipping insertion in model container [2025-02-08 00:13:13,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:13:13" (1/1) ... [2025-02-08 00:13:13,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:13:13,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c[1260,1273] [2025-02-08 00:13:14,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:13:14,017 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:13:14,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p4.c[1260,1273] [2025-02-08 00:13:14,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:13:14,163 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:13:14,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14 WrapperNode [2025-02-08 00:13:14,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:13:14,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:13:14,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:13:14,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:13:14,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,270 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1851 [2025-02-08 00:13:14,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:13:14,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:13:14,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:13:14,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:13:14,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,328 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:13:14,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:13:14,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:13:14,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:13:14,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:13:14,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (1/1) ... [2025-02-08 00:13:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:13:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:14,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:13:14,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:13:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:13:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:13:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:13:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:13:14,798 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:13:14,799 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:13:16,128 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-02-08 00:13:16,128 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:13:16,136 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:13:16,136 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:13:16,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:16 BoogieIcfgContainer [2025-02-08 00:13:16,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:13:16,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:13:16,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:13:16,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:13:16,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:13:13" (1/3) ... [2025-02-08 00:13:16,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78df291f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:13:16, skipping insertion in model container [2025-02-08 00:13:16,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:14" (2/3) ... [2025-02-08 00:13:16,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78df291f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:13:16, skipping insertion in model container [2025-02-08 00:13:16,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:16" (3/3) ... [2025-02-08 00:13:16,146 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c [2025-02-08 00:13:16,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:13:16,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p4.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:13:16,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:13:16,205 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;@53aba6ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:13:16,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:13:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:13:16,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:16,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:13:16,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:16,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:13:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:13:16,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634370271] [2025-02-08 00:13:16,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:16,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:16,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:13:16,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:13:16,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:13:16,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:13:16,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:16,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 00:13:16,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:16,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:13:16,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:13:16,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634370271] [2025-02-08 00:13:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634370271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:16,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:16,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:13:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654880783] [2025-02-08 00:13:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:16,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:13:16,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:16,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:16,760 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:16,891 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-08 00:13:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 00:13:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:16,899 INFO L225 Difference]: With dead ends: 15 [2025-02-08 00:13:16,900 INFO L226 Difference]: Without dead ends: 8 [2025-02-08 00:13:16,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:16,904 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:16,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:13:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-08 00:13:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-08 00:13:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:13:16,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:13:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:16,927 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:13:16,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:13:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:13:16,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:16,928 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:13:16,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:13:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:17,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:17,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:13:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:13:17,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777646583] [2025-02-08 00:13:17,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:17,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:17,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:17,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:13:17,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:13:17,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:13:17,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:13:17,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:17,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:17,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 00:13:17,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:17,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:13:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:18,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:13:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777646583] [2025-02-08 00:13:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777646583] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:13:18,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:13:18,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 00:13:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341901461] [2025-02-08 00:13:18,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:13:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:13:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:13:18,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:13:18,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:13:18,540 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:18,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:18,840 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-08 00:13:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:13:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 00:13:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:18,841 INFO L225 Difference]: With dead ends: 13 [2025-02-08 00:13:18,841 INFO L226 Difference]: Without dead ends: 11 [2025-02-08 00:13:18,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:13:18,842 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:18,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:13:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-08 00:13:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-08 00:13:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-08 00:13:18,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-08 00:13:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:18,845 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-08 00:13:18,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-08 00:13:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 00:13:18,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:18,845 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-08 00:13:18,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:13:19,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:19,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:19,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-08 00:13:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:13:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843390413] [2025-02-08 00:13:19,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:13:19,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:19,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:19,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:13:19,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:13:19,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 00:13:19,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:13:19,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:13:19,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:19,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-08 00:13:19,587 INFO L279 TraceCheckSpWp]: Computing forward predicates...