./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-74.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 037d5b4f4f3cfb963574c56e4f8027d9770852d6c9f3f3db4945c10da5726615 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:05:38,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:05:38,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:05:38,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:05:38,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:05:38,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:05:38,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:05:38,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:05:38,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:05:38,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:05:38,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:05:38,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:05:38,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:05:38,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:05:38,923 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:05:38,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:05:38,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:05:38,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:05:38,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:05:38,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:05:38,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:05:38,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:05:38,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:05:38,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:05:38,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:05:38,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:05:38,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:05:38,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:05:38,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:05:38,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:05:38,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:05:38,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:05:38,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:05:38,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:05:38,925 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 -> 037d5b4f4f3cfb963574c56e4f8027d9770852d6c9f3f3db4945c10da5726615 [2025-03-03 22:05:39,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:05:39,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:05:39,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:05:39,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:05:39,165 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:05:39,167 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-74.i [2025-03-03 22:05:40,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348d1845c/6b447794a8ef4094818541ab96c25262/FLAGa6cc3b469 [2025-03-03 22:05:40,486 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:05:40,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-74.i [2025-03-03 22:05:40,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348d1845c/6b447794a8ef4094818541ab96c25262/FLAGa6cc3b469 [2025-03-03 22:05:40,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348d1845c/6b447794a8ef4094818541ab96c25262 [2025-03-03 22:05:40,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:05:40,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:05:40,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:05:40,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:05:40,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:05:40,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6586bf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40, skipping insertion in model container [2025-03-03 22:05:40,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:05:40,646 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-74.i[919,932] [2025-03-03 22:05:40,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:05:40,734 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:05:40,743 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-74.i[919,932] [2025-03-03 22:05:40,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:05:40,789 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:05:40,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40 WrapperNode [2025-03-03 22:05:40,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:05:40,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:05:40,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:05:40,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:05:40,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,827 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2025-03-03 22:05:40,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:05:40,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:05:40,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:05:40,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:05:40,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:05:40,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:05:40,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:05:40,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:05:40,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:05:40,888 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (1/1) ... [2025-03-03 22:05:40,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:05:40,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:40,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:05:40,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:05:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:05:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:05:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:05:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:05:40,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:05:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:05:40,996 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:05:40,998 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:05:41,342 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc property_#t~ite25#1;havoc property_#t~bitwise24#1;havoc property_#t~short26#1; [2025-03-03 22:05:41,372 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 22:05:41,372 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:05:41,386 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:05:41,386 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 22:05:41,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:05:41 BoogieIcfgContainer [2025-03-03 22:05:41,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:05:41,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:05:41,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:05:41,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:05:41,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:05:40" (1/3) ... [2025-03-03 22:05:41,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aee16b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:05:41, skipping insertion in model container [2025-03-03 22:05:41,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:40" (2/3) ... [2025-03-03 22:05:41,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aee16b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:05:41, skipping insertion in model container [2025-03-03 22:05:41,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:05:41" (3/3) ... [2025-03-03 22:05:41,394 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-74.i [2025-03-03 22:05:41,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:05:41,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-74.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:05:41,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:05:41,457 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;@21d80272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:05:41,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:05:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:05:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:05:41,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:41,474 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:41,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:41,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1381179009, now seen corresponding path program 1 times [2025-03-03 22:05:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194798303] [2025-03-03 22:05:41,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:41,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:05:41,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:05:41,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:41,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:05:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:41,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194798303] [2025-03-03 22:05:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194798303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:05:41,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190478939] [2025-03-03 22:05:41,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:41,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:05:41,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:41,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:05:41,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:05:41,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:05:41,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:05:41,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:41,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:41,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:05:41,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:05:41,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:05:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190478939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:41,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:05:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:05:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292191457] [2025-03-03 22:05:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:41,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:05:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:41,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:05:41,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:05:41,973 INFO L87 Difference]: Start difference. First operand has 103 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:05:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:42,003 INFO L93 Difference]: Finished difference Result 197 states and 334 transitions. [2025-03-03 22:05:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:05:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 172 [2025-03-03 22:05:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:42,009 INFO L225 Difference]: With dead ends: 197 [2025-03-03 22:05:42,009 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 22:05:42,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 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-03 22:05:42,013 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:42,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:05:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 22:05:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 22:05:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:05:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2025-03-03 22:05:42,046 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 172 [2025-03-03 22:05:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:42,047 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2025-03-03 22:05:42,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:05:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2025-03-03 22:05:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:05:42,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:42,050 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:42,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:05:42,251 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-03 22:05:42,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:42,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:42,252 INFO L85 PathProgramCache]: Analyzing trace with hash -854311195, now seen corresponding path program 1 times [2025-03-03 22:05:42,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:42,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547521816] [2025-03-03 22:05:42,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:42,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:42,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:05:42,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:05:42,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:42,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:05:42,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547521816] [2025-03-03 22:05:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547521816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:42,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:05:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589750712] [2025-03-03 22:05:42,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:42,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:05:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:42,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:05:42,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:42,461 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:42,515 INFO L93 Difference]: Finished difference Result 225 states and 329 transitions. [2025-03-03 22:05:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:05:42,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2025-03-03 22:05:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:42,518 INFO L225 Difference]: With dead ends: 225 [2025-03-03 22:05:42,518 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 22:05:42,518 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-03 22:05:42,519 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 46 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:42,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 263 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:05:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 22:05:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-03-03 22:05:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 93 states have internal predecessors, (120), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 22:05:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2025-03-03 22:05:42,532 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 172 [2025-03-03 22:05:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:42,532 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2025-03-03 22:05:42,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2025-03-03 22:05:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:05:42,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:42,534 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:42,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:05:42,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:42,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1633201638, now seen corresponding path program 1 times [2025-03-03 22:05:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554443071] [2025-03-03 22:05:42,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:42,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:05:42,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:05:42,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:42,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:05:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554443071] [2025-03-03 22:05:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554443071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:42,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:42,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:05:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746073422] [2025-03-03 22:05:42,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:42,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:05:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:42,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:05:42,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:05:42,841 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:42,933 INFO L93 Difference]: Finished difference Result 332 states and 486 transitions. [2025-03-03 22:05:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:05:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2025-03-03 22:05:42,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:42,937 INFO L225 Difference]: With dead ends: 332 [2025-03-03 22:05:42,937 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 22:05:42,938 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-03 22:05:42,938 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 61 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:42,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 236 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:05:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 22:05:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2025-03-03 22:05:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 125 states have (on average 1.24) internal successors, (155), 126 states have internal predecessors, (155), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 22:05:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 271 transitions. [2025-03-03 22:05:42,976 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 271 transitions. Word has length 172 [2025-03-03 22:05:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:42,978 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 271 transitions. [2025-03-03 22:05:42,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 271 transitions. [2025-03-03 22:05:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 22:05:42,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:42,980 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:42,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:05:42,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:42,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1736644083, now seen corresponding path program 1 times [2025-03-03 22:05:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157590465] [2025-03-03 22:05:42,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:42,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 22:05:43,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 22:05:43,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:05:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157590465] [2025-03-03 22:05:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157590465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:43,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:43,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:05:43,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029097585] [2025-03-03 22:05:43,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:43,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:05:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:43,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:05:43,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:05:43,453 INFO L87 Difference]: Start difference. First operand 188 states and 271 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:43,765 INFO L93 Difference]: Finished difference Result 374 states and 539 transitions. [2025-03-03 22:05:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:05:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 174 [2025-03-03 22:05:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:43,768 INFO L225 Difference]: With dead ends: 374 [2025-03-03 22:05:43,768 INFO L226 Difference]: Without dead ends: 242 [2025-03-03 22:05:43,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:05:43,769 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 115 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:43,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 430 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:05:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-03 22:05:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 199. [2025-03-03 22:05:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 136 states have (on average 1.25) internal successors, (170), 137 states have internal predecessors, (170), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 22:05:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 286 transitions. [2025-03-03 22:05:43,790 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 286 transitions. Word has length 174 [2025-03-03 22:05:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:43,790 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 286 transitions. [2025-03-03 22:05:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 286 transitions. [2025-03-03 22:05:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 22:05:43,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:43,792 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:43,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:05:43,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:43,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 764117079, now seen corresponding path program 1 times [2025-03-03 22:05:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596254116] [2025-03-03 22:05:43,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:43,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 22:05:43,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 22:05:43,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:43,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:05:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:44,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596254116] [2025-03-03 22:05:44,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596254116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:44,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:05:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389717125] [2025-03-03 22:05:44,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:44,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:05:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:44,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:05:44,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:05:44,250 INFO L87 Difference]: Start difference. First operand 199 states and 286 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:44,652 INFO L93 Difference]: Finished difference Result 367 states and 529 transitions. [2025-03-03 22:05:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:05:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 175 [2025-03-03 22:05:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:44,655 INFO L225 Difference]: With dead ends: 367 [2025-03-03 22:05:44,656 INFO L226 Difference]: Without dead ends: 242 [2025-03-03 22:05:44,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:05:44,658 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 113 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:44,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 501 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:05:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-03 22:05:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 200. [2025-03-03 22:05:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 137 states have (on average 1.2481751824817517) internal successors, (171), 138 states have internal predecessors, (171), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 22:05:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 287 transitions. [2025-03-03 22:05:44,689 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 287 transitions. Word has length 175 [2025-03-03 22:05:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:44,691 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 287 transitions. [2025-03-03 22:05:44,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 287 transitions. [2025-03-03 22:05:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 22:05:44,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:44,693 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:44,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:05:44,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:44,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash 253582902, now seen corresponding path program 1 times [2025-03-03 22:05:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565604295] [2025-03-03 22:05:44,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:44,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 22:05:44,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 22:05:44,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:44,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:05:45,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:45,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565604295] [2025-03-03 22:05:45,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565604295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:45,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:05:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517528832] [2025-03-03 22:05:45,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:45,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:05:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:45,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:05:45,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:05:45,405 INFO L87 Difference]: Start difference. First operand 200 states and 287 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:45,836 INFO L93 Difference]: Finished difference Result 403 states and 580 transitions. [2025-03-03 22:05:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:05:45,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 175 [2025-03-03 22:05:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:45,839 INFO L225 Difference]: With dead ends: 403 [2025-03-03 22:05:45,839 INFO L226 Difference]: Without dead ends: 278 [2025-03-03 22:05:45,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:05:45,840 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 299 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:45,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 495 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:05:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-03 22:05:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2025-03-03 22:05:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 185 states have (on average 1.227027027027027) internal successors, (227), 188 states have internal predecessors, (227), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 22:05:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 379 transitions. [2025-03-03 22:05:45,875 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 379 transitions. Word has length 175 [2025-03-03 22:05:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:45,876 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 379 transitions. [2025-03-03 22:05:45,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:05:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 379 transitions. [2025-03-03 22:05:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 22:05:45,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:45,877 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:45,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:05:45,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:45,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1803220529, now seen corresponding path program 1 times [2025-03-03 22:05:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380755224] [2025-03-03 22:05:45,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:45,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 22:05:45,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 22:05:45,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:05:46,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:05:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380755224] [2025-03-03 22:05:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380755224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:05:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723682993] [2025-03-03 22:05:46,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:46,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:05:46,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:46,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:05:46,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:05:46,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 22:05:46,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 22:05:46,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:46,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:05:46,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 244 proven. 6 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-03-03 22:05:46,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:05:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:05:46,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723682993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:05:46,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:05:46,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-03-03 22:05:46,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079585106] [2025-03-03 22:05:46,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:05:46,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:05:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:05:46,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:05:46,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:05:46,699 INFO L87 Difference]: Start difference. First operand 268 states and 379 transitions. Second operand has 15 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 5 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 4 states have call predecessors, (43), 5 states have call successors, (43) [2025-03-03 22:05:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:47,639 INFO L93 Difference]: Finished difference Result 501 states and 694 transitions. [2025-03-03 22:05:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 22:05:47,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 5 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 4 states have call predecessors, (43), 5 states have call successors, (43) Word has length 177 [2025-03-03 22:05:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:47,642 INFO L225 Difference]: With dead ends: 501 [2025-03-03 22:05:47,643 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 22:05:47,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2025-03-03 22:05:47,644 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 301 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:05:47,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 510 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:05:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 22:05:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 284. [2025-03-03 22:05:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 197 states have (on average 1.1928934010152283) internal successors, (235), 200 states have internal predecessors, (235), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 22:05:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 387 transitions. [2025-03-03 22:05:47,678 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 387 transitions. Word has length 177 [2025-03-03 22:05:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:47,680 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 387 transitions. [2025-03-03 22:05:47,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 5 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 4 states have call predecessors, (43), 5 states have call successors, (43) [2025-03-03 22:05:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 387 transitions. [2025-03-03 22:05:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 22:05:47,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:47,685 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:47,692 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-03 22:05:47,885 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,SelfDestructingSolverStorable6 [2025-03-03 22:05:47,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:47,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash 872061350, now seen corresponding path program 1 times [2025-03-03 22:05:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:05:47,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894673512] [2025-03-03 22:05:47,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:05:47,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 22:05:47,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 22:05:47,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:47,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:05:47,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749235570] [2025-03-03 22:05:47,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:47,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:05:47,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:47,938 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-03 22:05:47,939 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-03 22:05:48,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 22:05:48,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 22:05:48,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:48,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:05:48,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:05:48,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 22:05:48,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 22:05:48,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:48,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:05:48,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:05:48,206 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:05:48,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:05:48,216 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-03 22:05:48,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:05:48,411 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:48,506 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:05:48,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:05:48 BoogieIcfgContainer [2025-03-03 22:05:48,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:05:48,512 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:05:48,512 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:05:48,512 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:05:48,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:05:41" (3/4) ... [2025-03-03 22:05:48,514 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:05:48,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:05:48,516 INFO L158 Benchmark]: Toolchain (without parser) took 7998.65ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 122.3MB in the beginning and 189.3MB in the end (delta: -67.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2025-03-03 22:05:48,516 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:05:48,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.61ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:05:48,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.47ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 100.6MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:05:48,517 INFO L158 Benchmark]: Boogie Preprocessor took 56.98ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 93.1MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:05:48,517 INFO L158 Benchmark]: IcfgBuilder took 499.79ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 61.1MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 22:05:48,517 INFO L158 Benchmark]: TraceAbstraction took 7122.99ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 60.7MB in the beginning and 189.3MB in the end (delta: -128.7MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2025-03-03 22:05:48,518 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 251.7MB. Free memory was 189.3MB in the beginning and 189.3MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:05:48,518 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.74ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.61ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.47ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 100.6MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.98ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 93.1MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 499.79ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 61.1MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7122.99ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 60.7MB in the beginning and 189.3MB in the end (delta: -128.7MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 251.7MB. Free memory was 189.3MB in the beginning and 189.3MB in the end (delta: 78.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 someBinaryFLOATComparisonOperation at line 171, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 163, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of bitwiseOr at line 68, overapproximation of bitwiseOr at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticFLOAToperation at line 130. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] signed char var_1_27 = 4; [L44] float var_1_28 = 3.5; [L45] signed short int var_1_29 = -8; [L46] signed char var_1_31 = -32; [L47] signed char var_1_32 = 2; [L48] signed long int var_1_34 = -4; [L49] double var_1_38 = 0.5; [L50] double var_1_39 = 255.8; [L51] unsigned long int last_1_var_1_1 = 64; [L52] unsigned char last_1_var_1_11 = 50; VAL [isInitial=0, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L181] last_1_var_1_1 = var_1_1 [L182] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L138] var_1_4 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L141] var_1_5 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L144] var_1_7 = __VERIFIER_nondet_ulong() [L145] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L147] var_1_9 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L148] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L150] var_1_10 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] var_1_12 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] var_1_13 = __VERIFIER_nondet_long() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] var_1_16 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_17 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] var_1_19 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] var_1_20 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L172] var_1_23 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L173] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L174] var_1_27 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L175] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L177] var_1_39 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_39 >= -922337.2036854765600e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] RET assume_abort_if_not((var_1_39 >= -922337.2036854765600e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L193] RET updateVariables() [L194] CALL step() [L56] COND FALSE !((~ (var_1_11 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L59] COND TRUE var_1_1 > var_1_11 [L60] var_1_28 = ((((4.2f) < (1.25f)) ? (4.2f) : (1.25f))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L62] COND TRUE (~ (5 + var_1_11)) >= 10000u [L63] var_1_29 = (((((var_1_11 + var_1_27)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((var_1_11 + var_1_27)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L67] var_1_31 = var_1_27 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L68] EXPR var_1_11 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L68] EXPR ((var_1_27) < ((var_1_11 | -5))) ? (var_1_27) : ((var_1_11 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L68] EXPR var_1_11 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L68] EXPR ((var_1_27) < ((var_1_11 | -5))) ? (var_1_27) : ((var_1_11 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L68] COND FALSE !(var_1_11 <= ((((var_1_27) < ((var_1_11 | -5))) ? (var_1_27) : ((var_1_11 | -5))))) [L73] COND TRUE ((((var_1_11) < (var_1_27)) ? (var_1_11) : (var_1_27))) <= var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L74] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L90] var_1_38 = var_1_39 [L91] signed long int stepLocal_1 = last_1_var_1_11; [L92] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L93] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L94] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L98] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L99] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L99] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L100] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L111] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L113] COND FALSE !(! (var_1_11 >= var_1_11)) [L120] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L122] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L127] COND FALSE !(\read(var_1_10)) [L130] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L132] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L133] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185-L186] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=21/5, var_1_29=50, var_1_31=0, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 935 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 935 mSDsluCounter, 2574 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1606 mSDsCounter, 435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1454 IncrementalHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 435 mSolverCounterUnsat, 968 mSDtfsCounter, 1454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 132 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1928 NumberOfCodeBlocks, 1928 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1733 ConstructedInterpolants, 0 QuantifiedInterpolants, 4488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 11898/12000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:05:48,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-74.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 037d5b4f4f3cfb963574c56e4f8027d9770852d6c9f3f3db4945c10da5726615 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:05:50,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:05:50,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:05:50,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:05:50,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:05:50,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:05:50,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:05:50,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:05:50,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:05:50,484 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:05:50,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:05:50,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:05:50,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:05:50,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:05:50,485 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:05:50,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:05:50,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:05:50,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:05:50,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:05:50,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:05:50,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:05:50,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:05:50,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:05:50,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:05:50,487 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:05:50,487 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:05:50,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:05:50,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:05:50,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:05:50,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:05:50,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:05:50,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:05:50,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:05:50,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:05:50,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:05:50,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:05:50,489 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 -> 037d5b4f4f3cfb963574c56e4f8027d9770852d6c9f3f3db4945c10da5726615 [2025-03-03 22:05:50,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:05:50,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:05:50,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:05:50,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:05:50,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:05:50,781 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-74.i [2025-03-03 22:05:51,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee5659c1/dd9ae0cec6bf4ed08144b15e7df80524/FLAGc3f088848 [2025-03-03 22:05:52,109 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:05:52,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-74.i [2025-03-03 22:05:52,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee5659c1/dd9ae0cec6bf4ed08144b15e7df80524/FLAGc3f088848 [2025-03-03 22:05:52,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee5659c1/dd9ae0cec6bf4ed08144b15e7df80524 [2025-03-03 22:05:52,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:05:52,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:05:52,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:05:52,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:05:52,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:05:52,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db37a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52, skipping insertion in model container [2025-03-03 22:05:52,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:05:52,608 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-74.i[919,932] [2025-03-03 22:05:52,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:05:52,673 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:05:52,681 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-74.i[919,932] [2025-03-03 22:05:52,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:05:52,715 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:05:52,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52 WrapperNode [2025-03-03 22:05:52,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:05:52,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:05:52,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:05:52,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:05:52,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,751 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-03-03 22:05:52,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:05:52,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:05:52,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:05:52,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:05:52,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,775 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:05:52,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:05:52,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:05:52,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:05:52,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:05:52,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (1/1) ... [2025-03-03 22:05:52,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:05:52,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:05:52,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:05:52,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:05:52,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:05:52,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:05:52,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:05:52,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:05:52,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:05:52,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:05:52,914 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:05:52,915 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:05:55,711 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 22:05:55,711 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:05:55,719 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:05:55,719 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:05:55,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:05:55 BoogieIcfgContainer [2025-03-03 22:05:55,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:05:55,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:05:55,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:05:55,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:05:55,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:05:52" (1/3) ... [2025-03-03 22:05:55,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef63545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:05:55, skipping insertion in model container [2025-03-03 22:05:55,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:05:52" (2/3) ... [2025-03-03 22:05:55,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef63545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:05:55, skipping insertion in model container [2025-03-03 22:05:55,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:05:55" (3/3) ... [2025-03-03 22:05:55,725 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-74.i [2025-03-03 22:05:55,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:05:55,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-74.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:05:55,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:05:55,787 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;@7fc8a35c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:05:55,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:05:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:05:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:05:55,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:55,801 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:55,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:55,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:55,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1124098772, now seen corresponding path program 1 times [2025-03-03 22:05:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:05:55,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6776161] [2025-03-03 22:05:55,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:55,818 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-03 22:05:55,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:05:55,821 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-03 22:05:55,823 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-03 22:05:55,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:05:56,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:05:56,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:56,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:56,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:05:56,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 22:05:56,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:05:56,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:05:56,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6776161] [2025-03-03 22:05:56,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6776161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:56,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:56,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:05:56,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759063908] [2025-03-03 22:05:56,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:56,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:05:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:05:56,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:05:56,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:05:56,234 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:05:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:05:56,264 INFO L93 Difference]: Finished difference Result 160 states and 278 transitions. [2025-03-03 22:05:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:05:56,266 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 166 [2025-03-03 22:05:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:05:56,271 INFO L225 Difference]: With dead ends: 160 [2025-03-03 22:05:56,272 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 22:05:56,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-03 22:05:56,275 INFO L435 NwaCegarLoop]: 115 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, 115 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-03 22:05:56,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:05:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 22:05:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 22:05:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:05:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2025-03-03 22:05:56,310 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 166 [2025-03-03 22:05:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:05:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2025-03-03 22:05:56,310 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:05:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2025-03-03 22:05:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 22:05:56,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:05:56,314 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:05:56,327 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-03 22:05:56,515 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-03 22:05:56,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:05:56,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:05:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash 641012082, now seen corresponding path program 1 times [2025-03-03 22:05:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:05:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927503430] [2025-03-03 22:05:56,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:05:56,518 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-03 22:05:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:05:56,520 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-03 22:05:56,522 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-03 22:05:56,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 22:05:56,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 22:05:56,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:05:56,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:05:56,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:05:56,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:05:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:05:58,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:05:58,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:05:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927503430] [2025-03-03 22:05:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927503430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:05:58,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:05:58,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:05:58,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452867537] [2025-03-03 22:05:58,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:05:58,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:05:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:05:58,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:05:58,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:05:58,044 INFO L87 Difference]: Start difference. First operand 78 states and 115 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:06:00,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:06:02,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:06:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:06:02,236 INFO L93 Difference]: Finished difference Result 229 states and 340 transitions. [2025-03-03 22:06:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:06:02,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-03-03 22:06:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:06:02,256 INFO L225 Difference]: With dead ends: 229 [2025-03-03 22:06:02,256 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 22:06:02,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:06:02,257 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 74 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:06:02,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 348 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 22:06:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 22:06:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2025-03-03 22:06:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:06:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 200 transitions. [2025-03-03 22:06:02,284 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 200 transitions. Word has length 166 [2025-03-03 22:06:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:06:02,286 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 200 transitions. [2025-03-03 22:06:02,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:06:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 200 transitions. [2025-03-03 22:06:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:06:02,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:06:02,288 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:06:02,301 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 22:06:02,490 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-03 22:06:02,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:06:02,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:06:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1723136013, now seen corresponding path program 1 times [2025-03-03 22:06:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:06:02,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019003013] [2025-03-03 22:06:02,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:06:02,491 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-03 22:06:02,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:06:02,493 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-03 22:06:02,494 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-03 22:06:02,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:06:02,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:06:02,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:06:02,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:06:02,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:06:02,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:06:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:06:03,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:06:03,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:06:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019003013] [2025-03-03 22:06:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019003013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:06:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:06:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:06:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812316174] [2025-03-03 22:06:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:06:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:06:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:06:03,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:06:03,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:06:03,747 INFO L87 Difference]: Start difference. First operand 136 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:06:06,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:06:08,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:06:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:06:08,782 INFO L93 Difference]: Finished difference Result 229 states and 338 transitions. [2025-03-03 22:06:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:06:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-03 22:06:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:06:08,803 INFO L225 Difference]: With dead ends: 229 [2025-03-03 22:06:08,803 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 22:06:08,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:06:08,804 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 72 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:06:08,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 349 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 22:06:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 22:06:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137. [2025-03-03 22:06:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:06:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2025-03-03 22:06:08,828 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 167 [2025-03-03 22:06:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:06:08,828 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 201 transitions. [2025-03-03 22:06:08,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:06:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2025-03-03 22:06:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:06:08,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:06:08,831 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:06:08,845 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-03 22:06:09,032 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-03 22:06:09,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:06:09,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:06:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1852218732, now seen corresponding path program 1 times [2025-03-03 22:06:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:06:09,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207334294] [2025-03-03 22:06:09,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:06:09,035 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-03 22:06:09,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:06:09,037 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-03 22:06:09,039 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-03 22:06:09,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:06:09,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:06:09,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:06:09,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:06:09,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 22:06:09,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:06:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-03 22:06:10,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:06:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:06:10,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:06:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207334294] [2025-03-03 22:06:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207334294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:06:10,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:06:10,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-03-03 22:06:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439559871] [2025-03-03 22:06:10,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:06:10,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 22:06:10,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:06:10,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 22:06:10,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:06:10,763 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-03-03 22:06:13,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:06:16,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:06:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:06:16,460 INFO L93 Difference]: Finished difference Result 267 states and 377 transitions. [2025-03-03 22:06:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 22:06:16,462 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 167 [2025-03-03 22:06:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:06:16,463 INFO L225 Difference]: With dead ends: 267 [2025-03-03 22:06:16,463 INFO L226 Difference]: Without dead ends: 192 [2025-03-03 22:06:16,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-03-03 22:06:16,464 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 90 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:06:16,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 473 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-03 22:06:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-03 22:06:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183. [2025-03-03 22:06:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 115 states have (on average 1.173913043478261) internal successors, (135), 116 states have internal predecessors, (135), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:06:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 255 transitions. [2025-03-03 22:06:16,495 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 255 transitions. Word has length 167 [2025-03-03 22:06:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:06:16,496 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 255 transitions. [2025-03-03 22:06:16,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-03-03 22:06:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 255 transitions. [2025-03-03 22:06:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 22:06:16,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:06:16,498 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:06:16,511 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-03 22:06:16,698 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-03 22:06:16,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:06:16,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:06:16,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1853142253, now seen corresponding path program 1 times [2025-03-03 22:06:16,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:06:16,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550442563] [2025-03-03 22:06:16,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:06:16,700 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-03 22:06:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:06:16,702 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-03 22:06:16,704 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-03 22:06:16,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 22:06:17,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 22:06:17,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:06:17,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:06:17,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 22:06:17,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:07:13,250 WARN L286 SmtUtils]: Spent 15.99s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)