./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:16:03,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:16:03,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:16:03,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:16:03,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:16:03,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:16:03,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:16:03,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:16:03,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:16:03,859 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:16:03,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:16:03,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:16:03,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:16:03,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:16:03,860 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:16:03,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:16:03,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:16:03,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:16:03,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:16:03,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:16:03,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:16:03,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:16:03,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:16:03,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:16:03,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:16:03,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:16:03,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:16:03,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:16:03,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:16:03,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:16:03,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:16:03,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:16:03,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:16:03,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:16:03,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2025-03-08 13:16:04,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:16:04,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:16:04,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:16:04,070 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:16:04,070 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:16:04,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-08 13:16:05,175 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e82371f/6950ec8338674283ab5f20a0a700e103/FLAG1e9be47a7 [2025-03-08 13:16:05,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:16:05,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-08 13:16:05,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e82371f/6950ec8338674283ab5f20a0a700e103/FLAG1e9be47a7 [2025-03-08 13:16:05,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e82371f/6950ec8338674283ab5f20a0a700e103 [2025-03-08 13:16:05,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:16:05,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:16:05,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:16:05,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:16:05,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:16:05,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:16:05" (1/1) ... [2025-03-08 13:16:05,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13daf968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:05, skipping insertion in model container [2025-03-08 13:16:05,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:16:05" (1/1) ... [2025-03-08 13:16:05,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:16:05,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2025-03-08 13:16:05,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:16:05,949 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:16:05,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2025-03-08 13:16:05,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:16:06,004 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:16:06,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06 WrapperNode [2025-03-08 13:16:06,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:16:06,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:16:06,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:16:06,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:16:06,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,050 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-08 13:16:06,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:16:06,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:16:06,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:16:06,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:16:06,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,086 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:16:06,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,091 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:16:06,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:16:06,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:16:06,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:16:06,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (1/1) ... [2025-03-08 13:16:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:16:06,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:16:06,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:16:06,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:16:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:16:06,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:16:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:16:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:16:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:16:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:16:06,207 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:16:06,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:16:06,481 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 13:16:06,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:16:06,490 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:16:06,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:16:06,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:16:06 BoogieIcfgContainer [2025-03-08 13:16:06,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:16:06,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:16:06,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:16:06,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:16:06,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:16:05" (1/3) ... [2025-03-08 13:16:06,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39745321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:16:06, skipping insertion in model container [2025-03-08 13:16:06,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:16:06" (2/3) ... [2025-03-08 13:16:06,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39745321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:16:06, skipping insertion in model container [2025-03-08 13:16:06,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:16:06" (3/3) ... [2025-03-08 13:16:06,501 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-08 13:16:06,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:16:06,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:16:06,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:16:06,583 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;@767124d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:16:06,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:16:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 13:16:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 13:16:06,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:06,598 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:06,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:06,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1226635345, now seen corresponding path program 1 times [2025-03-08 13:16:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327929076] [2025-03-08 13:16:06,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:06,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 13:16:06,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 13:16:06,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:06,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 13:16:06,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:06,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327929076] [2025-03-08 13:16:06,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327929076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:16:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559635328] [2025-03-08 13:16:06,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:06,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:16:06,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:16:06,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:16:06,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:16:06,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 13:16:07,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 13:16:07,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:07,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:07,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:16:07,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:16:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 13:16:07,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:16:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559635328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:07,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:16:07,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:16:07,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468944048] [2025-03-08 13:16:07,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:16:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:07,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:16:07,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:16:07,077 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 13:16:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:07,103 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-03-08 13:16:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:16:07,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-03-08 13:16:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:07,112 INFO L225 Difference]: With dead ends: 162 [2025-03-08 13:16:07,112 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 13:16:07,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:16:07,118 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:07,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:16:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 13:16:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 13:16:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 13:16:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2025-03-08 13:16:07,159 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 161 [2025-03-08 13:16:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:07,161 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2025-03-08 13:16:07,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 13:16:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2025-03-08 13:16:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 13:16:07,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:07,165 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:07,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:16:07,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:16:07,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:07,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -773531213, now seen corresponding path program 1 times [2025-03-08 13:16:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:07,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983157506] [2025-03-08 13:16:07,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:07,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 13:16:07,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 13:16:07,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:07,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:07,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983157506] [2025-03-08 13:16:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983157506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:07,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:16:07,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901092343] [2025-03-08 13:16:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:07,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:16:07,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:07,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:16:07,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:16:07,632 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:07,689 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2025-03-08 13:16:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:16:07,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-08 13:16:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:07,692 INFO L225 Difference]: With dead ends: 237 [2025-03-08 13:16:07,692 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 13:16:07,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:16:07,693 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:07,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:16:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 13:16:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-08 13:16:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 13:16:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2025-03-08 13:16:07,736 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 161 [2025-03-08 13:16:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:07,736 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2025-03-08 13:16:07,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2025-03-08 13:16:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 13:16:07,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:07,738 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:07,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:16:07,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash -562180300, now seen corresponding path program 1 times [2025-03-08 13:16:07,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:07,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686071661] [2025-03-08 13:16:07,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:07,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 13:16:07,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 13:16:07,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:07,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:08,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:08,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686071661] [2025-03-08 13:16:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686071661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:08,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:16:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861729950] [2025-03-08 13:16:08,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:08,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:16:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:08,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:16:08,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:16:08,057 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:08,377 INFO L93 Difference]: Finished difference Result 562 states and 899 transitions. [2025-03-08 13:16:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:16:08,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-08 13:16:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:08,381 INFO L225 Difference]: With dead ends: 562 [2025-03-08 13:16:08,384 INFO L226 Difference]: Without dead ends: 408 [2025-03-08 13:16:08,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:16:08,386 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 198 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:08,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 429 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:16:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-08 13:16:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 353. [2025-03-08 13:16:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 227 states have (on average 1.3920704845814977) internal successors, (316), 227 states have internal predecessors, (316), 120 states have call successors, (120), 5 states have call predecessors, (120), 5 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 13:16:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 556 transitions. [2025-03-08 13:16:08,439 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 556 transitions. Word has length 161 [2025-03-08 13:16:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:08,442 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 556 transitions. [2025-03-08 13:16:08,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 556 transitions. [2025-03-08 13:16:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:08,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:08,445 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:16:08,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1975410223, now seen corresponding path program 1 times [2025-03-08 13:16:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121332530] [2025-03-08 13:16:08,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:08,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:08,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:08,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:08,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:12,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:12,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121332530] [2025-03-08 13:16:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121332530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:12,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:12,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 13:16:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896003380] [2025-03-08 13:16:12,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:12,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 13:16:12,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:12,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 13:16:12,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:16:12,011 INFO L87 Difference]: Start difference. First operand 353 states and 556 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:12,955 INFO L93 Difference]: Finished difference Result 693 states and 1065 transitions. [2025-03-08 13:16:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 13:16:12,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 13:16:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:12,963 INFO L225 Difference]: With dead ends: 693 [2025-03-08 13:16:12,966 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 13:16:12,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 13:16:12,968 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 212 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:12,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 691 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 13:16:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 13:16:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 427. [2025-03-08 13:16:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 291 states have (on average 1.4089347079037802) internal successors, (410), 293 states have internal predecessors, (410), 128 states have call successors, (128), 7 states have call predecessors, (128), 7 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-08 13:16:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 666 transitions. [2025-03-08 13:16:13,019 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 666 transitions. Word has length 162 [2025-03-08 13:16:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:13,020 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 666 transitions. [2025-03-08 13:16:13,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 666 transitions. [2025-03-08 13:16:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:13,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:13,024 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:13,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:16:13,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:13,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1976333744, now seen corresponding path program 1 times [2025-03-08 13:16:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:13,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6083876] [2025-03-08 13:16:13,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:13,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:13,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:13,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:13,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:38,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6083876] [2025-03-08 13:16:38,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6083876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:38,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:38,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 13:16:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035766070] [2025-03-08 13:16:38,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:38,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 13:16:38,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:38,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 13:16:38,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:16:38,116 INFO L87 Difference]: Start difference. First operand 427 states and 666 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:40,553 INFO L93 Difference]: Finished difference Result 499 states and 758 transitions. [2025-03-08 13:16:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 13:16:40,554 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 13:16:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:40,558 INFO L225 Difference]: With dead ends: 499 [2025-03-08 13:16:40,558 INFO L226 Difference]: Without dead ends: 497 [2025-03-08 13:16:40,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-08 13:16:40,559 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 138 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:40,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 798 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 13:16:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-08 13:16:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 430. [2025-03-08 13:16:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 296 states have internal predecessors, (414), 128 states have call successors, (128), 7 states have call predecessors, (128), 7 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-08 13:16:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 670 transitions. [2025-03-08 13:16:40,592 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 670 transitions. Word has length 162 [2025-03-08 13:16:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:40,592 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 670 transitions. [2025-03-08 13:16:40,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 670 transitions. [2025-03-08 13:16:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:40,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:40,594 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:40,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:16:40,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:40,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash 167955760, now seen corresponding path program 1 times [2025-03-08 13:16:40,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:40,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240695396] [2025-03-08 13:16:40,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:40,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:40,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:40,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:40,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:40,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240695396] [2025-03-08 13:16:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240695396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 13:16:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261964062] [2025-03-08 13:16:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:43,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 13:16:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:43,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 13:16:43,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:16:43,283 INFO L87 Difference]: Start difference. First operand 430 states and 670 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:44,010 INFO L93 Difference]: Finished difference Result 537 states and 803 transitions. [2025-03-08 13:16:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 13:16:44,011 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 13:16:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:44,013 INFO L225 Difference]: With dead ends: 537 [2025-03-08 13:16:44,013 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 13:16:44,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 13:16:44,014 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 187 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:44,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 810 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 13:16:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 13:16:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 434. [2025-03-08 13:16:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 298 states have (on average 1.4093959731543624) internal successors, (420), 300 states have internal predecessors, (420), 128 states have call successors, (128), 7 states have call predecessors, (128), 7 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-08 13:16:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 676 transitions. [2025-03-08 13:16:44,035 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 676 transitions. Word has length 162 [2025-03-08 13:16:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:44,035 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 676 transitions. [2025-03-08 13:16:44,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 676 transitions. [2025-03-08 13:16:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:44,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:44,037 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:44,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:16:44,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:44,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash 168879281, now seen corresponding path program 1 times [2025-03-08 13:16:44,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:44,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355041187] [2025-03-08 13:16:44,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:44,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:44,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:44,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:44,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355041187] [2025-03-08 13:16:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355041187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:47,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:47,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 13:16:47,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751794963] [2025-03-08 13:16:47,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:47,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 13:16:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:47,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 13:16:47,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:16:47,925 INFO L87 Difference]: Start difference. First operand 434 states and 676 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:49,032 INFO L93 Difference]: Finished difference Result 535 states and 801 transitions. [2025-03-08 13:16:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 13:16:49,033 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 13:16:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:49,035 INFO L225 Difference]: With dead ends: 535 [2025-03-08 13:16:49,035 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 13:16:49,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 13:16:49,036 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:49,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 815 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:16:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 13:16:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 432. [2025-03-08 13:16:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 296 states have (on average 1.4087837837837838) internal successors, (417), 298 states have internal predecessors, (417), 128 states have call successors, (128), 7 states have call predecessors, (128), 7 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-08 13:16:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 673 transitions. [2025-03-08 13:16:49,062 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 673 transitions. Word has length 162 [2025-03-08 13:16:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:49,062 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 673 transitions. [2025-03-08 13:16:49,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 673 transitions. [2025-03-08 13:16:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:49,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:49,065 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:49,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 13:16:49,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:49,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2104492942, now seen corresponding path program 1 times [2025-03-08 13:16:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77351019] [2025-03-08 13:16:49,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:49,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:49,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:49,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:49,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:49,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:49,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77351019] [2025-03-08 13:16:49,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77351019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:49,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:49,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:16:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650094622] [2025-03-08 13:16:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:49,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:16:49,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:49,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:16:49,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:16:49,111 INFO L87 Difference]: Start difference. First operand 432 states and 673 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:49,163 INFO L93 Difference]: Finished difference Result 881 states and 1377 transitions. [2025-03-08 13:16:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:16:49,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 13:16:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:49,166 INFO L225 Difference]: With dead ends: 881 [2025-03-08 13:16:49,168 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 13:16:49,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:16:49,170 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 108 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:49,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 335 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:16:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 13:16:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 498. [2025-03-08 13:16:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 357 states have (on average 1.361344537815126) internal successors, (486), 360 states have internal predecessors, (486), 132 states have call successors, (132), 8 states have call predecessors, (132), 8 states have return successors, (132), 129 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 13:16:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 750 transitions. [2025-03-08 13:16:49,200 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 750 transitions. Word has length 162 [2025-03-08 13:16:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:49,200 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 750 transitions. [2025-03-08 13:16:49,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 750 transitions. [2025-03-08 13:16:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:49,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:49,202 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:49,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 13:16:49,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:49,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash -447664019, now seen corresponding path program 1 times [2025-03-08 13:16:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:49,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595509191] [2025-03-08 13:16:49,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:49,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:49,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:49,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:49,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:49,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:49,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595509191] [2025-03-08 13:16:49,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595509191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:49,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:49,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:16:49,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323442112] [2025-03-08 13:16:49,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:49,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:16:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:49,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:16:49,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:16:49,280 INFO L87 Difference]: Start difference. First operand 498 states and 750 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:49,486 INFO L93 Difference]: Finished difference Result 1090 states and 1611 transitions. [2025-03-08 13:16:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:16:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 13:16:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:49,491 INFO L225 Difference]: With dead ends: 1090 [2025-03-08 13:16:49,492 INFO L226 Difference]: Without dead ends: 676 [2025-03-08 13:16:49,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 13:16:49,497 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 92 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:49,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 371 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:16:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-08 13:16:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 630. [2025-03-08 13:16:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 453 states have (on average 1.3399558498896247) internal successors, (607), 458 states have internal predecessors, (607), 164 states have call successors, (164), 12 states have call predecessors, (164), 12 states have return successors, (164), 159 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 13:16:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 935 transitions. [2025-03-08 13:16:49,537 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 935 transitions. Word has length 162 [2025-03-08 13:16:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:49,537 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 935 transitions. [2025-03-08 13:16:49,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 935 transitions. [2025-03-08 13:16:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:49,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:49,540 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:49,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 13:16:49,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:49,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2039848814, now seen corresponding path program 1 times [2025-03-08 13:16:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281745341] [2025-03-08 13:16:49,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:49,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:49,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:49,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:49,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281745341] [2025-03-08 13:16:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281745341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:51,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 13:16:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911210725] [2025-03-08 13:16:51,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:51,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:16:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:51,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:16:51,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:16:51,128 INFO L87 Difference]: Start difference. First operand 630 states and 935 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:51,806 INFO L93 Difference]: Finished difference Result 776 states and 1102 transitions. [2025-03-08 13:16:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:16:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 13:16:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:51,811 INFO L225 Difference]: With dead ends: 776 [2025-03-08 13:16:51,811 INFO L226 Difference]: Without dead ends: 774 [2025-03-08 13:16:51,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:16:51,812 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 324 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:51,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 648 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 13:16:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-03-08 13:16:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 686. [2025-03-08 13:16:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 498 states have (on average 1.3253012048192772) internal successors, (660), 505 states have internal predecessors, (660), 172 states have call successors, (172), 15 states have call predecessors, (172), 15 states have return successors, (172), 165 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-08 13:16:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1004 transitions. [2025-03-08 13:16:51,851 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1004 transitions. Word has length 162 [2025-03-08 13:16:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:51,853 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1004 transitions. [2025-03-08 13:16:51,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1004 transitions. [2025-03-08 13:16:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:51,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:51,857 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 13:16:51,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2040772335, now seen corresponding path program 1 times [2025-03-08 13:16:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015980788] [2025-03-08 13:16:51,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:51,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:51,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:51,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015980788] [2025-03-08 13:16:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015980788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 13:16:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287273584] [2025-03-08 13:16:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:54,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 13:16:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:54,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 13:16:54,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:16:54,494 INFO L87 Difference]: Start difference. First operand 686 states and 1004 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:55,438 INFO L93 Difference]: Finished difference Result 774 states and 1100 transitions. [2025-03-08 13:16:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 13:16:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-03-08 13:16:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:55,444 INFO L225 Difference]: With dead ends: 774 [2025-03-08 13:16:55,444 INFO L226 Difference]: Without dead ends: 772 [2025-03-08 13:16:55,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:16:55,445 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 245 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:55,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 714 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 13:16:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-08 13:16:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 686. [2025-03-08 13:16:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 498 states have (on average 1.3253012048192772) internal successors, (660), 505 states have internal predecessors, (660), 172 states have call successors, (172), 15 states have call predecessors, (172), 15 states have return successors, (172), 165 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-08 13:16:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1004 transitions. [2025-03-08 13:16:55,484 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1004 transitions. Word has length 162 [2025-03-08 13:16:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:55,484 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1004 transitions. [2025-03-08 13:16:55,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1004 transitions. [2025-03-08 13:16:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:16:55,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:55,487 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:55,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 13:16:55,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:55,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1682007216, now seen corresponding path program 1 times [2025-03-08 13:16:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:55,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969369688] [2025-03-08 13:16:55,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:55,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:16:55,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:16:55,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:55,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:55,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:55,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969369688] [2025-03-08 13:16:55,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969369688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:55,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:55,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:16:55,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405650514] [2025-03-08 13:16:55,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:55,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:16:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:55,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:16:55,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:16:55,663 INFO L87 Difference]: Start difference. First operand 686 states and 1004 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 13:16:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:55,880 INFO L93 Difference]: Finished difference Result 1203 states and 1745 transitions. [2025-03-08 13:16:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:16:55,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2025-03-08 13:16:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:55,884 INFO L225 Difference]: With dead ends: 1203 [2025-03-08 13:16:55,885 INFO L226 Difference]: Without dead ends: 695 [2025-03-08 13:16:55,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:16:55,887 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 147 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:55,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 243 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:16:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-08 13:16:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 685. [2025-03-08 13:16:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 488 states have (on average 1.2950819672131149) internal successors, (632), 495 states have internal predecessors, (632), 178 states have call successors, (178), 18 states have call predecessors, (178), 18 states have return successors, (178), 171 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-08 13:16:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 988 transitions. [2025-03-08 13:16:55,943 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 988 transitions. Word has length 162 [2025-03-08 13:16:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:55,944 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 988 transitions. [2025-03-08 13:16:55,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 13:16:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 988 transitions. [2025-03-08 13:16:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 13:16:55,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:55,946 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:55,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 13:16:55,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:55,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2013120782, now seen corresponding path program 1 times [2025-03-08 13:16:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:55,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991820174] [2025-03-08 13:16:55,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:55,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 13:16:55,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 13:16:55,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:55,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-08 13:16:56,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:56,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991820174] [2025-03-08 13:16:56,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991820174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:16:56,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859857763] [2025-03-08 13:16:56,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:56,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:16:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:16:56,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:16:56,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:16:56,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 13:16:56,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 13:16:56,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:56,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:56,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 13:16:56,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:16:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-03-08 13:16:56,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:16:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-08 13:16:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859857763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:16:56,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:16:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2025-03-08 13:16:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623819741] [2025-03-08 13:16:56,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:16:56,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 13:16:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:56,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 13:16:56,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:16:56,612 INFO L87 Difference]: Start difference. First operand 685 states and 988 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2025-03-08 13:16:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:57,184 INFO L93 Difference]: Finished difference Result 1843 states and 2630 transitions. [2025-03-08 13:16:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 13:16:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 163 [2025-03-08 13:16:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:57,190 INFO L225 Difference]: With dead ends: 1843 [2025-03-08 13:16:57,191 INFO L226 Difference]: Without dead ends: 1227 [2025-03-08 13:16:57,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2025-03-08 13:16:57,193 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 448 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:57,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 422 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 13:16:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-03-08 13:16:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1085. [2025-03-08 13:16:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 763 states have (on average 1.2621231979030145) internal successors, (963), 780 states have internal predecessors, (963), 290 states have call successors, (290), 31 states have call predecessors, (290), 31 states have return successors, (290), 273 states have call predecessors, (290), 290 states have call successors, (290) [2025-03-08 13:16:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1543 transitions. [2025-03-08 13:16:57,273 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1543 transitions. Word has length 163 [2025-03-08 13:16:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:57,273 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1543 transitions. [2025-03-08 13:16:57,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2025-03-08 13:16:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1543 transitions. [2025-03-08 13:16:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 13:16:57,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:57,276 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:57,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:16:57,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 13:16:57,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -192789202, now seen corresponding path program 1 times [2025-03-08 13:16:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023486461] [2025-03-08 13:16:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:57,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 13:16:57,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 13:16:57,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:57,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:57,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:57,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023486461] [2025-03-08 13:16:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023486461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:16:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11540637] [2025-03-08 13:16:57,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:16:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:57,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:16:57,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:16:57,528 INFO L87 Difference]: Start difference. First operand 1085 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:57,603 INFO L93 Difference]: Finished difference Result 2096 states and 2979 transitions. [2025-03-08 13:16:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:16:57,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2025-03-08 13:16:57,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:57,610 INFO L225 Difference]: With dead ends: 2096 [2025-03-08 13:16:57,610 INFO L226 Difference]: Without dead ends: 1085 [2025-03-08 13:16:57,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:16:57,614 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 58 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:57,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 230 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:16:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-03-08 13:16:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2025-03-08 13:16:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 763 states have (on average 1.2568807339449541) internal successors, (959), 780 states have internal predecessors, (959), 290 states have call successors, (290), 31 states have call predecessors, (290), 31 states have return successors, (290), 273 states have call predecessors, (290), 290 states have call successors, (290) [2025-03-08 13:16:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1539 transitions. [2025-03-08 13:16:57,695 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1539 transitions. Word has length 163 [2025-03-08 13:16:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:57,695 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1539 transitions. [2025-03-08 13:16:57,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1539 transitions. [2025-03-08 13:16:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 13:16:57,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:57,698 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:57,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 13:16:57,699 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:57,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash 216035023, now seen corresponding path program 1 times [2025-03-08 13:16:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467351905] [2025-03-08 13:16:57,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:57,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 13:16:57,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 13:16:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:16:57,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:16:57,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467351905] [2025-03-08 13:16:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467351905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:16:57,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:16:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:16:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340135777] [2025-03-08 13:16:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:16:57,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:16:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:16:57,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:16:57,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:16:57,798 INFO L87 Difference]: Start difference. First operand 1085 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:16:57,884 INFO L93 Difference]: Finished difference Result 1920 states and 2725 transitions. [2025-03-08 13:16:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:16:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2025-03-08 13:16:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:16:57,889 INFO L225 Difference]: With dead ends: 1920 [2025-03-08 13:16:57,890 INFO L226 Difference]: Without dead ends: 918 [2025-03-08 13:16:57,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:16:57,893 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 57 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:16:57,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 220 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:16:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-08 13:16:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 902. [2025-03-08 13:16:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 634 states have (on average 1.2602523659305993) internal successors, (799), 648 states have internal predecessors, (799), 240 states have call successors, (240), 27 states have call predecessors, (240), 27 states have return successors, (240), 226 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 13:16:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1279 transitions. [2025-03-08 13:16:57,953 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1279 transitions. Word has length 163 [2025-03-08 13:16:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:16:57,954 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1279 transitions. [2025-03-08 13:16:57,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:16:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1279 transitions. [2025-03-08 13:16:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 13:16:57,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:16:57,955 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:16:57,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 13:16:57,956 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:16:57,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:16:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash 730862250, now seen corresponding path program 1 times [2025-03-08 13:16:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:16:57,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791088780] [2025-03-08 13:16:57,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:16:57,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 13:16:58,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 13:16:58,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:58,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:16:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936709956] [2025-03-08 13:16:58,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:16:58,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:16:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:16:58,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:16:58,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 13:16:58,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 13:16:58,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 13:16:58,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:16:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:16:58,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 13:16:58,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:16:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 625 proven. 132 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-08 13:16:59,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:17:04,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:17:04,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791088780] [2025-03-08 13:17:04,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 13:17:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936709956] [2025-03-08 13:17:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936709956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:17:04,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:17:04,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-08 13:17:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004095940] [2025-03-08 13:17:04,062 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 13:17:04,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 13:17:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:17:04,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 13:17:04,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-08 13:17:04,063 INFO L87 Difference]: Start difference. First operand 902 states and 1279 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-03-08 13:17:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:17:04,968 INFO L93 Difference]: Finished difference Result 1568 states and 2055 transitions. [2025-03-08 13:17:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 13:17:04,969 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 164 [2025-03-08 13:17:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:17:04,974 INFO L225 Difference]: With dead ends: 1568 [2025-03-08 13:17:04,975 INFO L226 Difference]: Without dead ends: 1271 [2025-03-08 13:17:04,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=1031, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 13:17:04,977 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 157 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:17:04,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 570 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 13:17:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-03-08 13:17:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1042. [2025-03-08 13:17:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 741 states have (on average 1.214574898785425) internal successors, (900), 755 states have internal predecessors, (900), 236 states have call successors, (236), 64 states have call predecessors, (236), 64 states have return successors, (236), 222 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-08 13:17:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1372 transitions. [2025-03-08 13:17:05,127 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1372 transitions. Word has length 164 [2025-03-08 13:17:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:17:05,127 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1372 transitions. [2025-03-08 13:17:05,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-03-08 13:17:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1372 transitions. [2025-03-08 13:17:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 13:17:05,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:17:05,129 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:05,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 13:17:05,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:17:05,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:17:05,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:17:05,331 INFO L85 PathProgramCache]: Analyzing trace with hash 731785771, now seen corresponding path program 1 times [2025-03-08 13:17:05,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:17:05,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813210767] [2025-03-08 13:17:05,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:05,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:17:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 13:17:05,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 13:17:05,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:05,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:17:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058635666] [2025-03-08 13:17:05,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:05,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:17:05,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:17:05,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:17:05,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 13:17:05,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 13:17:05,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 13:17:05,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:05,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:17:05,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:17:05,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 13:17:05,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 13:17:05,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:05,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:17:05,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:17:05,631 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:17:05,632 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:17:05,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 13:17:05,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 13:17:05,837 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:05,944 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:17:05,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:17:05 BoogieIcfgContainer [2025-03-08 13:17:05,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:17:05,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:17:05,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:17:05,947 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:17:05,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:16:06" (3/4) ... [2025-03-08 13:17:05,950 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:17:05,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:17:05,952 INFO L158 Benchmark]: Toolchain (without parser) took 60202.04ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 112.6MB in the beginning and 53.1MB in the end (delta: 59.5MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2025-03-08 13:17:05,952 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:17:05,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.27ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:17:05,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.53ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:17:05,953 INFO L158 Benchmark]: Boogie Preprocessor took 48.96ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 90.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:17:05,953 INFO L158 Benchmark]: IcfgBuilder took 385.52ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 66.1MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:17:05,953 INFO L158 Benchmark]: TraceAbstraction took 59454.47ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 65.2MB in the beginning and 53.8MB in the end (delta: 11.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2025-03-08 13:17:05,953 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 167.8MB. Free memory was 53.8MB in the beginning and 53.1MB in the end (delta: 629.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:17:05,954 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.27ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.53ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.96ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 90.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 385.52ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 66.1MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 59454.47ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 65.2MB in the beginning and 53.8MB in the end (delta: 11.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 167.8MB. Free memory was 53.8MB in the beginning and 53.1MB in the end (delta: 629.4kB). 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: 19]: 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 someUnaryDOUBLEoperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] signed long int var_1_22 = -8; [L40] unsigned long int var_1_26 = 10; [L41] signed long int var_1_28 = -10000; [L42] signed long int var_1_29 = -1263929197; [L43] signed short int var_1_31 = 1; [L44] unsigned char var_1_36 = 32; [L45] unsigned char var_1_38 = 2; [L46] double var_1_39 = 3.6; [L47] double var_1_40 = 24.25; [L48] double var_1_41 = 31.25; [L49] unsigned long int var_1_42 = 10; [L50] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=8, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L179] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=8, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L141] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L142] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L142] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L143] var_1_4 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L144] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L145] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L145] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L146] var_1_6 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L147] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L148] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L148] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=2, var_1_8=256] [L149] var_1_7 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L151] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L151] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L152] var_1_10 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L153] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L154] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L154] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L155] var_1_11 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L156] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L157] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L157] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L160] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L160] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L161] var_1_20 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L162] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L163] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L163] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L164] var_1_21 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L165] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L166] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L166] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L167] var_1_29 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_29 >= -2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L168] RET assume_abort_if_not(var_1_29 >= -2147483646) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L169] CALL assume_abort_if_not(var_1_29 <= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L169] RET assume_abort_if_not(var_1_29 <= -1073741823) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L170] var_1_38 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L171] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L172] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L172] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L173] var_1_40 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L174] RET assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L175] var_1_41 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L176] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L190] RET updateVariables() [L191] CALL step() [L54] COND FALSE !(var_1_16 > var_1_18) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L59] var_1_26 = var_1_8 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L60] COND FALSE !(((((-256) < 0 ) ? -(-256) : (-256))) < var_1_19) [L63] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L65] COND TRUE var_1_8 > var_1_18 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L66] COND TRUE var_1_29 < var_1_18 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L67] COND TRUE var_1_29 <= (-64 & var_1_19) [L68] var_1_31 = ((((var_1_1) > (((((8) < (var_1_1)) ? (8) : (var_1_1))))) ? (var_1_1) : (((((8) < (var_1_1)) ? (8) : (var_1_1)))))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L74] COND FALSE !(((((((((var_1_8) > (var_1_15)) ? (var_1_8) : (var_1_15)))) > (var_1_1)) ? (((((var_1_8) > (var_1_15)) ? (var_1_8) : (var_1_15)))) : (var_1_1))) > var_1_8) [L79] var_1_36 = var_1_38 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L81] var_1_39 = ((((((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40)))) > (((((var_1_41) < (100.75)) ? (var_1_41) : (100.75))))) ? (((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40)))) : (((((var_1_41) < (100.75)) ? (var_1_41) : (100.75)))))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=10, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L82] COND FALSE !(var_1_8 <= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) [L93] var_1_42 = var_1_38 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L95] signed char stepLocal_1 = var_1_6; [L96] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=62, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=256] [L97] COND FALSE !(-25 == stepLocal_1) [L102] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L104] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=0, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L105] COND TRUE var_1_8 >= stepLocal_2 [L106] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L108] COND TRUE \read(var_1_12) [L109] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L111] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/2, var_1_6=62, var_1_7=0, var_1_8=49151] [L112] COND TRUE \read(var_1_12) [L113] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L116] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=62, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L117] COND TRUE var_1_1 < stepLocal_4 [L118] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=62, var_1_19=25, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L122] COND TRUE \read(var_1_12) [L123] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L125] COND TRUE -64 > (var_1_6 + var_1_19) [L126] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L134] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=49152, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L135] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49151, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=62, var_1_19=-127, var_1_1=-1, var_1_20=189, var_1_21=189, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=62, var_1_5=33/4, var_1_6=62, var_1_7=0, var_1_8=49151] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 156 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.3s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2651 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2623 mSDsluCounter, 7671 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5527 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4892 IncrementalHoareTripleChecker+Invalid, 5196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 2144 mSDtfsCounter, 4892 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 859 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=13, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 1057 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 46.5s InterpolantComputationTime, 3410 NumberOfCodeBlocks, 3410 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3062 ConstructedInterpolants, 1 QuantifiedInterpolants, 18404 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1160 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 20762/20976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:17:06,166 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-08 13:17:06,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:17:07,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:17:07,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:17:07,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:17:07,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:17:08,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:17:08,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:17:08,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:17:08,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:17:08,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:17:08,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:17:08,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:17:08,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:17:08,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:17:08,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:17:08,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:17:08,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:17:08,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:17:08,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:17:08,027 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:17:08,027 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:17:08,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:17:08,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:17:08,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:17:08,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:17:08,027 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2025-03-08 13:17:08,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:17:08,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:17:08,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:17:08,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:17:08,282 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:17:08,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-08 13:17:09,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0302e84c/e70440df08344f429f6f3924c3f202a4/FLAGd90501ce0 [2025-03-08 13:17:09,694 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:17:09,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-08 13:17:09,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0302e84c/e70440df08344f429f6f3924c3f202a4/FLAGd90501ce0 [2025-03-08 13:17:09,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0302e84c/e70440df08344f429f6f3924c3f202a4 [2025-03-08 13:17:09,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:17:09,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:17:09,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:17:09,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:17:09,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:17:09,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:17:09" (1/1) ... [2025-03-08 13:17:09,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e95c313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:09, skipping insertion in model container [2025-03-08 13:17:09,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:17:09" (1/1) ... [2025-03-08 13:17:09,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:17:09,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2025-03-08 13:17:09,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:17:09,954 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:17:09,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2025-03-08 13:17:10,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:17:10,024 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:17:10,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10 WrapperNode [2025-03-08 13:17:10,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:17:10,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:17:10,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:17:10,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:17:10,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,065 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-08 13:17:10,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:17:10,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:17:10,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:17:10,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:17:10,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,091 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:17:10,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:17:10,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:17:10,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:17:10,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:17:10,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (1/1) ... [2025-03-08 13:17:10,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:17:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:17:10,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:17:10,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:17:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:17:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:17:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:17:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:17:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:17:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:17:10,215 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:17:10,217 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:17:10,569 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 13:17:10,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:17:10,580 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:17:10,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:17:10,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:17:10 BoogieIcfgContainer [2025-03-08 13:17:10,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:17:10,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:17:10,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:17:10,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:17:10,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:17:09" (1/3) ... [2025-03-08 13:17:10,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11678245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:17:10, skipping insertion in model container [2025-03-08 13:17:10,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:10" (2/3) ... [2025-03-08 13:17:10,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11678245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:17:10, skipping insertion in model container [2025-03-08 13:17:10,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:17:10" (3/3) ... [2025-03-08 13:17:10,590 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-03-08 13:17:10,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:17:10,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:17:10,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:17:10,653 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;@7885cc98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:17:10,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:17:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 13:17:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 13:17:10,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:17:10,669 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:10,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:17:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:17:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1226635345, now seen corresponding path program 1 times [2025-03-08 13:17:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:17:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521313265] [2025-03-08 13:17:10,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:10,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:17:10,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:17:10,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:17:10,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 13:17:10,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 13:17:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:10,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:17:10,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:17:10,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:17:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-08 13:17:10,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:17:10,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:17:10,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521313265] [2025-03-08 13:17:10,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521313265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:17:10,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:17:10,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:17:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960009716] [2025-03-08 13:17:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:17:10,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:17:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:17:10,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:17:10,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:17:10,968 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 13:17:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:17:10,992 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-03-08 13:17:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:17:10,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-03-08 13:17:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:17:11,000 INFO L225 Difference]: With dead ends: 162 [2025-03-08 13:17:11,000 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 13:17:11,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:17:11,004 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:17:11,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:17:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 13:17:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 13:17:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 13:17:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2025-03-08 13:17:11,035 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 161 [2025-03-08 13:17:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:17:11,035 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2025-03-08 13:17:11,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 13:17:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2025-03-08 13:17:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 13:17:11,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:17:11,037 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:11,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:17:11,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:11,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:17:11,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:17:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash -773531213, now seen corresponding path program 1 times [2025-03-08 13:17:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:17:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617338614] [2025-03-08 13:17:11,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:11,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:11,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:17:11,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:17:11,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:17:11,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 13:17:11,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 13:17:11,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:11,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:17:11,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 13:17:11,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:17:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:17:11,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:17:11,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:17:11,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617338614] [2025-03-08 13:17:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617338614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:17:11,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:17:11,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:17:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978817405] [2025-03-08 13:17:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:17:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:17:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:17:11,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:17:11,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:17:11,705 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:17:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:17:11,772 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2025-03-08 13:17:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:17:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-08 13:17:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:17:11,774 INFO L225 Difference]: With dead ends: 237 [2025-03-08 13:17:11,774 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 13:17:11,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:17:11,776 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 54 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:17:11,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:17:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 13:17:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-08 13:17:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 13:17:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2025-03-08 13:17:11,809 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 161 [2025-03-08 13:17:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:17:11,809 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2025-03-08 13:17:11,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:17:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2025-03-08 13:17:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 13:17:11,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:17:11,813 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:11,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:17:12,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:12,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:17:12,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:17:12,014 INFO L85 PathProgramCache]: Analyzing trace with hash -562180300, now seen corresponding path program 1 times [2025-03-08 13:17:12,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:17:12,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866144663] [2025-03-08 13:17:12,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:12,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:12,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:17:12,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:17:12,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:17:12,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 13:17:12,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 13:17:12,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:12,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:17:12,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:17:12,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:17:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 13:17:12,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:17:12,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:17:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866144663] [2025-03-08 13:17:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866144663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:17:12,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:17:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:17:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606561806] [2025-03-08 13:17:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:17:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:17:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:17:12,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:17:12,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:17:12,743 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:17:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:17:12,852 INFO L93 Difference]: Finished difference Result 375 states and 597 transitions. [2025-03-08 13:17:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:17:12,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-03-08 13:17:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:17:12,855 INFO L225 Difference]: With dead ends: 375 [2025-03-08 13:17:12,855 INFO L226 Difference]: Without dead ends: 221 [2025-03-08 13:17:12,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:17:12,860 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 25 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:17:12,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:17:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-08 13:17:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2025-03-08 13:17:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 13:17:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 338 transitions. [2025-03-08 13:17:12,891 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 338 transitions. Word has length 161 [2025-03-08 13:17:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:17:12,892 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 338 transitions. [2025-03-08 13:17:12,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 13:17:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 338 transitions. [2025-03-08 13:17:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 13:17:12,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:17:12,896 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:12,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 13:17:13,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:13,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:17:13,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:17:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1975410223, now seen corresponding path program 1 times [2025-03-08 13:17:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:17:13,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461062753] [2025-03-08 13:17:13,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:13,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:13,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:17:13,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:17:13,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 13:17:13,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 13:17:13,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 13:17:13,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:13,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:17:13,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 13:17:13,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:17:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-03-08 13:17:13,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:17:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-08 13:17:13,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:17:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461062753] [2025-03-08 13:17:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461062753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:17:13,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:17:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-08 13:17:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728392481] [2025-03-08 13:17:13,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:17:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:17:13,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:17:13,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:17:13,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:17:13,673 INFO L87 Difference]: Start difference. First operand 216 states and 338 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-08 13:17:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:17:14,367 INFO L93 Difference]: Finished difference Result 485 states and 750 transitions. [2025-03-08 13:17:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 13:17:14,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 162 [2025-03-08 13:17:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:17:14,370 INFO L225 Difference]: With dead ends: 485 [2025-03-08 13:17:14,370 INFO L226 Difference]: Without dead ends: 322 [2025-03-08 13:17:14,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:17:14,374 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 285 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:17:14,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 313 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 13:17:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-08 13:17:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 310. [2025-03-08 13:17:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 195 states have (on average 1.3384615384615384) internal successors, (261), 197 states have internal predecessors, (261), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 13:17:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 477 transitions. [2025-03-08 13:17:14,403 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 477 transitions. Word has length 162 [2025-03-08 13:17:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:17:14,403 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 477 transitions. [2025-03-08 13:17:14,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-08 13:17:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 477 transitions. [2025-03-08 13:17:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 13:17:14,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:17:14,404 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:14,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 13:17:14,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:14,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:17:14,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:17:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash 262810487, now seen corresponding path program 1 times [2025-03-08 13:17:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:17:14,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673629727] [2025-03-08 13:17:14,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:14,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:17:14,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:17:14,608 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:17:14,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 13:17:14,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 13:17:14,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 13:17:14,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:14,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:17:14,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 13:17:14,726 INFO L279 TraceCheckSpWp]: Computing forward predicates...