./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.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 476382d18560c39f16aae727092b47108fdc1ae0e3eedbadcc67982af5d45e6d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:01:52,197 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:01:52,246 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 16:01:52,252 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:01:52,253 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:01:52,266 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:01:52,267 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:01:52,267 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:01:52,267 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:01:52,267 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:01:52,267 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:01:52,267 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:01:52,268 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:01:52,268 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:01:52,268 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:01:52,269 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:01:52,269 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:01:52,269 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:01:52,270 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:01:52,270 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 -> 476382d18560c39f16aae727092b47108fdc1ae0e3eedbadcc67982af5d45e6d
[2025-03-08 16:01:52,502 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:01:52,511 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:01:52,513 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:01:52,515 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:01:52,515 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:01:52,516 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i
[2025-03-08 16:01:53,692 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d706709/4710e2b5e7874187b01a90d97706f8f4/FLAG7bb5aeca0
[2025-03-08 16:01:53,896 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:01:53,897 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i
[2025-03-08 16:01:53,905 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d706709/4710e2b5e7874187b01a90d97706f8f4/FLAG7bb5aeca0
[2025-03-08 16:01:53,919 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d706709/4710e2b5e7874187b01a90d97706f8f4
[2025-03-08 16:01:53,922 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:01:53,923 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:01:53,924 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:01:53,925 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:01:53,928 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:01:53,929 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:01:53" (1/1) ...
[2025-03-08 16:01:53,931 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:53, skipping insertion in model container
[2025-03-08 16:01:53,932 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:01:53" (1/1) ...
[2025-03-08 16:01:53,942 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:01:54,043 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_variablewrapping_normal_file-13.i[913,926]
[2025-03-08 16:01:54,082 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:01:54,091 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:01:54,099 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_variablewrapping_normal_file-13.i[913,926]
[2025-03-08 16:01:54,120 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:01:54,134 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:01:54,135 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54 WrapperNode
[2025-03-08 16:01:54,135 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:01:54,136 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:01:54,136 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:01:54,136 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:01:54,140 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,146 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,173 INFO  L138                Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102
[2025-03-08 16:01:54,173 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:01:54,174 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:01:54,174 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:01:54,174 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:01:54,181 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,181 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,184 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,200 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 16:01:54,201 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,201 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,204 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,205 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,205 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,206 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,207 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:01:54,208 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:01:54,208 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:01:54,208 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:01:54,210 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (1/1) ...
[2025-03-08 16:01:54,216 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:01:54,229 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:01:54,246 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 16:01:54,251 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 16:01:54,265 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:01:54,265 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:01:54,265 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:01:54,265 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 16:01:54,265 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:01:54,266 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:01:54,317 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:01:54,318 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:01:54,469 INFO  L?                        ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2025-03-08 16:01:54,470 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:01:54,475 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:01:54,476 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:01:54,476 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:01:54 BoogieIcfgContainer
[2025-03-08 16:01:54,476 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:01:54,478 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:01:54,478 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:01:54,481 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:01:54,481 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:01:53" (1/3) ...
[2025-03-08 16:01:54,482 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8bc083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:01:54, skipping insertion in model container
[2025-03-08 16:01:54,482 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:01:54" (2/3) ...
[2025-03-08 16:01:54,482 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8bc083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:01:54, skipping insertion in model container
[2025-03-08 16:01:54,483 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:01:54" (3/3) ...
[2025-03-08 16:01:54,483 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-13.i
[2025-03-08 16:01:54,494 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:01:54,495 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-13.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:01:54,537 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:01:54,547 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;@7cde7c75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:01:54,547 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:01:54,551 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-03-08 16:01:54,556 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-08 16:01:54,557 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:01:54,557 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:01:54,557 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:01:54,560 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:01:54,561 INFO  L85        PathProgramCache]: Analyzing trace with hash -1318319713, now seen corresponding path program 1 times
[2025-03-08 16:01:54,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:01:54,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767618666]
[2025-03-08 16:01:54,566 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:01:54,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:01:54,626 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-08 16:01:54,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-08 16:01:54,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:01:54,639 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:01:54,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2025-03-08 16:01:54,751 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:01:54,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767618666]
[2025-03-08 16:01:54,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767618666] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:01:54,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640904176]
[2025-03-08 16:01:54,752 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:01:54,753 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:01:54,753 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:01:54,755 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:01:54,756 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 16:01:54,810 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-08 16:01:54,858 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-08 16:01:54,859 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:01:54,859 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:01:54,861 INFO  L256         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:01:54,869 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:01:54,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2025-03-08 16:01:54,888 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:01:54,888 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640904176] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:01:54,888 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:01:54,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 16:01:54,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765288747]
[2025-03-08 16:01:54,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:01:54,894 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:01:54,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:01:54,905 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:01:54,906 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:01:54,907 INFO  L87              Difference]: Start difference. First operand  has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand  has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-08 16:01:54,920 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:01:54,920 INFO  L93              Difference]: Finished difference Result 90 states and 148 transitions.
[2025-03-08 16:01:54,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:01:54,921 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98
[2025-03-08 16:01:54,922 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:01:54,925 INFO  L225             Difference]: With dead ends: 90
[2025-03-08 16:01:54,925 INFO  L226             Difference]: Without dead ends: 45
[2025-03-08 16:01:54,927 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:01:54,929 INFO  L435           NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:01:54,929 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:01:54,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2025-03-08 16:01:54,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2025-03-08 16:01:54,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-03-08 16:01:54,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions.
[2025-03-08 16:01:54,953 INFO  L78                 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 98
[2025-03-08 16:01:54,953 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:01:54,953 INFO  L471      AbstractCegarLoop]: Abstraction has 45 states and 63 transitions.
[2025-03-08 16:01:54,954 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-08 16:01:54,954 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions.
[2025-03-08 16:01:54,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-08 16:01:54,956 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:01:54,956 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:01:54,963 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 16:01:55,158 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 16:01:55,158 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:01:55,159 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:01:55,159 INFO  L85        PathProgramCache]: Analyzing trace with hash -121078685, now seen corresponding path program 1 times
[2025-03-08 16:01:55,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:01:55,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672770905]
[2025-03-08 16:01:55,160 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:01:55,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:01:55,200 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:01:55,299 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:01:55,300 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:01:55,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:01:56,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-08 16:01:56,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:01:56,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672770905]
[2025-03-08 16:01:56,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672770905] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:01:56,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:01:56,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 16:01:56,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114678705]
[2025-03-08 16:01:56,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:01:56,518 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:01:56,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:01:56,518 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:01:56,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:01:56,519 INFO  L87              Difference]: Start difference. First operand 45 states and 63 transitions. Second operand  has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:01:56,858 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:01:56,858 INFO  L93              Difference]: Finished difference Result 118 states and 157 transitions.
[2025-03-08 16:01:56,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:01:56,859 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99
[2025-03-08 16:01:56,860 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:01:56,861 INFO  L225             Difference]: With dead ends: 118
[2025-03-08 16:01:56,863 INFO  L226             Difference]: Without dead ends: 116
[2025-03-08 16:01:56,863 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2025-03-08 16:01:56,864 INFO  L435           NwaCegarLoop]: 102 mSDtfsCounter, 132 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:01:56,864 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 496 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:01:56,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2025-03-08 16:01:56,882 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92.
[2025-03-08 16:01:56,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-08 16:01:56,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions.
[2025-03-08 16:01:56,885 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99
[2025-03-08 16:01:56,887 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:01:56,887 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 131 transitions.
[2025-03-08 16:01:56,887 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:01:56,887 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions.
[2025-03-08 16:01:56,888 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-08 16:01:56,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:01:56,889 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:01:56,889 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 16:01:56,889 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:01:56,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:01:56,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -120155164, now seen corresponding path program 1 times
[2025-03-08 16:01:56,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:01:56,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604750775]
[2025-03-08 16:01:56,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:01:56,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:01:56,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:01:56,934 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:01:56,938 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:01:56,938 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:01:57,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-08 16:01:57,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:01:57,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604750775]
[2025-03-08 16:01:57,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604750775] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:01:57,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:01:57,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 16:01:57,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052342999]
[2025-03-08 16:01:57,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:01:57,745 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 16:01:57,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:01:57,746 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 16:01:57,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:01:57,746 INFO  L87              Difference]: Start difference. First operand 92 states and 131 transitions. Second operand  has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:01:57,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:01:57,983 INFO  L93              Difference]: Finished difference Result 116 states and 155 transitions.
[2025-03-08 16:01:57,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 16:01:57,984 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99
[2025-03-08 16:01:57,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:01:57,985 INFO  L225             Difference]: With dead ends: 116
[2025-03-08 16:01:57,985 INFO  L226             Difference]: Without dead ends: 114
[2025-03-08 16:01:57,985 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:01:57,986 INFO  L435           NwaCegarLoop]: 105 mSDtfsCounter, 107 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:01:57,986 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 431 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:01:57,986 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2025-03-08 16:01:57,995 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92.
[2025-03-08 16:01:57,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-08 16:01:57,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions.
[2025-03-08 16:01:57,997 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99
[2025-03-08 16:01:57,997 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:01:57,997 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 131 transitions.
[2025-03-08 16:01:57,997 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:01:57,997 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions.
[2025-03-08 16:01:57,998 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-08 16:01:57,998 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:01:57,998 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:01:57,998 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 16:01:57,998 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:01:57,999 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:01:57,999 INFO  L85        PathProgramCache]: Analyzing trace with hash 1621731650, now seen corresponding path program 1 times
[2025-03-08 16:01:57,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:01:57,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160968399]
[2025-03-08 16:01:57,999 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:01:57,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:01:58,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:01:58,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:01:58,025 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:01:58,025 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:01:58,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-08 16:01:58,756 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:01:58,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160968399]
[2025-03-08 16:01:58,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160968399] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:01:58,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:01:58,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 16:01:58,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978546961]
[2025-03-08 16:01:58,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:01:58,757 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 16:01:58,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:01:58,758 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 16:01:58,758 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 16:01:58,758 INFO  L87              Difference]: Start difference. First operand 92 states and 131 transitions. Second operand  has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:01:59,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:01:59,022 INFO  L93              Difference]: Finished difference Result 116 states and 155 transitions.
[2025-03-08 16:01:59,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 16:01:59,022 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99
[2025-03-08 16:01:59,023 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:01:59,024 INFO  L225             Difference]: With dead ends: 116
[2025-03-08 16:01:59,026 INFO  L226             Difference]: Without dead ends: 114
[2025-03-08 16:01:59,026 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:01:59,026 INFO  L435           NwaCegarLoop]: 110 mSDtfsCounter, 82 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 16:01:59,027 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 574 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 16:01:59,028 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2025-03-08 16:01:59,040 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95.
[2025-03-08 16:01:59,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-08 16:01:59,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions.
[2025-03-08 16:01:59,045 INFO  L78                 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 99
[2025-03-08 16:01:59,045 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:01:59,045 INFO  L471      AbstractCegarLoop]: Abstraction has 95 states and 135 transitions.
[2025-03-08 16:01:59,045 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:01:59,046 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions.
[2025-03-08 16:01:59,046 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-08 16:01:59,046 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:01:59,046 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:01:59,046 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 16:01:59,046 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:01:59,047 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:01:59,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 1622655171, now seen corresponding path program 1 times
[2025-03-08 16:01:59,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:01:59,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287374552]
[2025-03-08 16:01:59,047 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:01:59,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:01:59,059 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:01:59,071 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:01:59,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:01:59,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:02:00,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-08 16:02:00,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:02:00,078 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287374552]
[2025-03-08 16:02:00,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287374552] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:02:00,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:02:00,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 16:02:00,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858303135]
[2025-03-08 16:02:00,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:02:00,078 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 16:02:00,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:02:00,079 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 16:02:00,079 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 16:02:00,079 INFO  L87              Difference]: Start difference. First operand 95 states and 135 transitions. Second operand  has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:02:00,274 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:02:00,274 INFO  L93              Difference]: Finished difference Result 97 states and 136 transitions.
[2025-03-08 16:02:00,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 16:02:00,275 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99
[2025-03-08 16:02:00,275 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:02:00,276 INFO  L225             Difference]: With dead ends: 97
[2025-03-08 16:02:00,277 INFO  L226             Difference]: Without dead ends: 45
[2025-03-08 16:02:00,278 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110
[2025-03-08 16:02:00,278 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:02:00,278 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 368 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:02:00,279 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2025-03-08 16:02:00,283 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2025-03-08 16:02:00,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-03-08 16:02:00,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions.
[2025-03-08 16:02:00,286 INFO  L78                 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 99
[2025-03-08 16:02:00,286 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:02:00,286 INFO  L471      AbstractCegarLoop]: Abstraction has 45 states and 62 transitions.
[2025-03-08 16:02:00,286 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:02:00,288 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions.
[2025-03-08 16:02:00,288 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-08 16:02:00,289 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:02:00,289 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:02:00,289 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 16:02:00,289 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:02:00,289 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:02:00,289 INFO  L85        PathProgramCache]: Analyzing trace with hash -317592190, now seen corresponding path program 1 times
[2025-03-08 16:02:00,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:02:00,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735640525]
[2025-03-08 16:02:00,289 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:02:00,289 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:02:00,300 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:02:00,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:02:00,322 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:02:00,322 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 16:02:00,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608008575]
[2025-03-08 16:02:00,324 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:02:00,324 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:02:00,324 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:02:00,326 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:02:00,327 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 16:02:00,366 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:02:00,418 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:02:00,418 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:02:00,418 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:02:00,418 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 16:02:00,429 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:02:00,441 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:02:00,441 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:02:00,441 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:02:00,484 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 16:02:00,484 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 16:02:00,485 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 16:02:00,492 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-08 16:02:00,686 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,SelfDestructingSolverStorable5
[2025-03-08 16:02:00,689 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2025-03-08 16:02:00,743 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 16:02:00,747 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:02:00 BoogieIcfgContainer
[2025-03-08 16:02:00,748 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 16:02:00,749 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 16:02:00,749 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 16:02:00,749 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 16:02:00,750 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:01:54" (3/4) ...
[2025-03-08 16:02:00,751 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 16:02:00,752 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 16:02:00,752 INFO  L158              Benchmark]: Toolchain (without parser) took 6829.18ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 113.1MB in the beginning and 181.1MB in the end (delta: -68.0MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB.
[2025-03-08 16:02:00,754 INFO  L158              Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:02:00,754 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 210.79ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.2MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:02:00,754 INFO  L158              Benchmark]: Boogie Procedure Inliner took 37.71ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 97.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:02:00,754 INFO  L158              Benchmark]: Boogie Preprocessor took 33.62ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:02:00,754 INFO  L158              Benchmark]: IcfgBuilder took 268.19ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 79.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 16:02:00,754 INFO  L158              Benchmark]: TraceAbstraction took 6270.85ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 78.5MB in the beginning and 181.1MB in the end (delta: -102.7MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB.
[2025-03-08 16:02:00,755 INFO  L158              Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 327.2MB. Free memory was 181.1MB in the beginning and 181.1MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:02:00,755 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 210.79ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.2MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 37.71ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 97.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 33.62ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 268.19ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 79.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 6270.85ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 78.5MB in the beginning and 181.1MB in the end (delta: -102.7MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB.
 * Witness Printer took 2.97ms. Allocated memory is still 327.2MB. Free memory was 181.1MB in the beginning and 181.1MB in the end (delta: 48.1kB). 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 someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 83. 
Possible FailurePath: 
[L21]                  unsigned char isInitial = 0;
[L22]                  unsigned short int var_1_1 = 25;
[L23]                  unsigned char var_1_2 = 1;
[L24]                  signed char var_1_5 = 16;
[L25]                  unsigned short int var_1_6 = 16;
[L26]                  signed char var_1_7 = 4;
[L27]                  unsigned short int var_1_8 = 2;
[L28]                  signed char var_1_9 = 64;
[L29]                  signed char var_1_10 = 0;
[L30]                  unsigned char var_1_11 = 16;
[L31]                  double var_1_12 = 128.4;
[L32]                  double var_1_13 = 50.2;
[L33]                  double var_1_14 = 3.8;
[L34]                  double var_1_15 = 25.1;
           VAL         [isInitial=0, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L92]                  isInitial = 1
[L93]      FCALL       initially()
[L94]      COND TRUE   1
[L95]      FCALL       updateLastVariables()
[L96]      CALL        updateVariables()
[L60]                  var_1_2 = __VERIFIER_nondet_uchar()
[L61]      CALL        assume_abort_if_not(var_1_2 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L61]      RET         assume_abort_if_not(var_1_2 >= 0)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L62]      CALL        assume_abort_if_not(var_1_2 <= 1)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L62]      RET         assume_abort_if_not(var_1_2 <= 1)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L63]                  var_1_6 = __VERIFIER_nondet_ushort()
[L64]      CALL        assume_abort_if_not(var_1_6 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L64]      RET         assume_abort_if_not(var_1_6 >= 0)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L65]      CALL        assume_abort_if_not(var_1_6 <= 65535)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L65]      RET         assume_abort_if_not(var_1_6 <= 65535)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64]
[L66]      CALL        assume_abort_if_not(var_1_6 != 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64]
[L66]      RET         assume_abort_if_not(var_1_6 != 0)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64]
[L67]                  var_1_7 = __VERIFIER_nondet_char()
[L68]      CALL        assume_abort_if_not(var_1_7 >= -127)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64]
[L68]      RET         assume_abort_if_not(var_1_7 >= -127)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64]
[L69]      CALL        assume_abort_if_not(var_1_7 <= 126)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64]
[L69]      RET         assume_abort_if_not(var_1_7 <= 126)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64]
[L70]                  var_1_9 = __VERIFIER_nondet_char()
[L71]      CALL        assume_abort_if_not(var_1_9 >= 63)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L71]      RET         assume_abort_if_not(var_1_9 >= 63)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L72]      CALL        assume_abort_if_not(var_1_9 <= 127)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L72]      RET         assume_abort_if_not(var_1_9 <= 127)
           VAL         [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L73]                  var_1_10 = __VERIFIER_nondet_char()
[L74]      CALL        assume_abort_if_not(var_1_10 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L74]      RET         assume_abort_if_not(var_1_10 >= 0)
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L75]      CALL        assume_abort_if_not(var_1_10 <= 64)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L75]      RET         assume_abort_if_not(var_1_10 <= 64)
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L76]                  var_1_12 = __VERIFIER_nondet_double()
[L77]      CALL        assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ))
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L77]      RET         assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ))
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L78]                  var_1_13 = __VERIFIER_nondet_double()
[L79]      CALL        assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ))
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L79]      RET         assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ))
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L80]                  var_1_14 = __VERIFIER_nondet_double()
[L81]      CALL        assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ))
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L81]      RET         assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ))
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L82]                  var_1_15 = __VERIFIER_nondet_double()
[L83]      CALL        assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L83]      RET         assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L96]      RET         updateVariables()
[L97]      CALL        step()
[L38]      COND FALSE  !(((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15)))))
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L41]      COND TRUE   \read(var_1_2)
[L42]                  var_1_1 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)))
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L44]      COND TRUE   (var_1_1 == 16) || (var_1_11 < (10 / var_1_6))
[L45]                  var_1_5 = var_1_7
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L49]                  unsigned char stepLocal_1 = var_1_11;
[L50]                  unsigned char stepLocal_0 = var_1_2;
           VAL         [isInitial=1, stepLocal_1=16, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L51]      COND TRUE   stepLocal_0 || (var_1_11 >= var_1_11)
           VAL         [isInitial=1, stepLocal_1=16, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63]
[L52]      COND TRUE   stepLocal_1 < ((var_1_9 - var_1_10) - 16)
[L53]                  var_1_8 = ((((var_1_10) > (32)) ? (var_1_10) : (32)))
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63]
[L97]      RET         step()
[L98]      CALL, EXPR  property()
[L88-L89]              return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))))) : 1) && (((var_1_1 == 16) || (var_1_11 < (10 / var_1_6))) ? (var_1_5 == ((signed char) var_1_7)) : (var_1_5 == ((signed char) 5)))) && ((var_1_2 || (var_1_11 >= var_1_11)) ? ((var_1_11 < ((var_1_9 - var_1_10) - 16)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) > (32)) ? (var_1_10) : (32))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11))))))) && ((((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) ? (var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1)
;
           VAL         [\result=0, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63]
[L98]      RET, EXPR   property()
[L98]      CALL        __VERIFIER_assert(property())
[L19]      COND TRUE   !(cond)
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63]
[L19]                  reach_error()
           VAL         [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 48 locations, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 396 mSDsluCounter, 1932 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 480 mSDtfsCounter, 604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 65 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 790 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 586 ConstructedInterpolants, 0 QuantifiedInterpolants, 1415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2492/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-08 16:02:00,779 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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_variablewrapping_normal_file-13.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 476382d18560c39f16aae727092b47108fdc1ae0e3eedbadcc67982af5d45e6d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:02:02,508 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:02:02,576 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-08 16:02:02,590 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:02:02,592 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:02:02,616 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:02:02,618 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:02:02,618 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:02:02,618 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:02:02,618 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:02:02,618 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:02:02,619 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:02:02,619 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:02:02,619 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:02:02,619 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:02:02,619 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 16:02:02,620 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 16:02:02,621 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 16:02:02,621 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:02:02,621 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:02:02,621 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:02:02,621 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:02:02,621 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:02:02,621 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:02:02,621 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:02:02,622 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:02:02,622 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:02:02,622 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:02:02,622 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:02:02,622 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:02:02,622 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:02:02,622 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 16:02:02,622 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-08 16:02:02,622 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:02:02,623 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:02:02,623 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:02:02,623 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:02:02,623 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 -> 476382d18560c39f16aae727092b47108fdc1ae0e3eedbadcc67982af5d45e6d
[2025-03-08 16:02:02,840 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:02:02,847 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:02:02,849 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:02:02,849 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:02:02,850 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:02:02,850 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i
[2025-03-08 16:02:03,958 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6efced86/898b100216dc4e068b502f2d1f0e3391/FLAGb61730b4a
[2025-03-08 16:02:04,149 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:02:04,150 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i
[2025-03-08 16:02:04,155 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6efced86/898b100216dc4e068b502f2d1f0e3391/FLAGb61730b4a
[2025-03-08 16:02:04,165 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6efced86/898b100216dc4e068b502f2d1f0e3391
[2025-03-08 16:02:04,166 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:02:04,167 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:02:04,168 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:02:04,168 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:02:04,171 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:02:04,172 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,172 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bbab53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04, skipping insertion in model container
[2025-03-08 16:02:04,172 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,185 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:02:04,282 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_variablewrapping_normal_file-13.i[913,926]
[2025-03-08 16:02:04,332 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:02:04,345 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:02:04,355 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_variablewrapping_normal_file-13.i[913,926]
[2025-03-08 16:02:04,377 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:02:04,393 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:02:04,394 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04 WrapperNode
[2025-03-08 16:02:04,394 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:02:04,395 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:02:04,395 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:02:04,395 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:02:04,400 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,408 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,426 INFO  L138                Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99
[2025-03-08 16:02:04,426 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:02:04,426 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:02:04,426 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:02:04,427 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:02:04,432 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,432 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,433 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,443 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 16:02:04,443 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,443 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,447 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,448 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,449 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,449 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,451 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:02:04,451 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:02:04,451 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:02:04,451 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:02:04,452 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (1/1) ...
[2025-03-08 16:02:04,456 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:02:04,463 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:02:04,473 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 16:02:04,479 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 16:02:04,494 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:02:04,494 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 16:02:04,494 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:02:04,494 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:02:04,494 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:02:04,494 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:02:04,549 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:02:04,550 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:02:10,700 INFO  L?                        ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2025-03-08 16:02:10,701 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:02:10,707 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:02:10,708 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:02:10,709 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:10 BoogieIcfgContainer
[2025-03-08 16:02:10,709 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:02:10,712 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:02:10,712 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:02:10,715 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:02:10,715 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:02:04" (1/3) ...
[2025-03-08 16:02:10,716 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c619706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:10, skipping insertion in model container
[2025-03-08 16:02:10,716 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:02:04" (2/3) ...
[2025-03-08 16:02:10,716 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c619706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:02:10, skipping insertion in model container
[2025-03-08 16:02:10,716 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:02:10" (3/3) ...
[2025-03-08 16:02:10,718 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-13.i
[2025-03-08 16:02:10,727 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:02:10,728 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-13.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:02:10,768 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:02:10,777 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;@2493025c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:02:10,777 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:02:10,779 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-03-08 16:02:10,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-08 16:02:10,786 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:02:10,786 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:02:10,786 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:02:10,790 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:02:10,791 INFO  L85        PathProgramCache]: Analyzing trace with hash -1318319713, now seen corresponding path program 1 times
[2025-03-08 16:02:10,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:02:10,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255097887]
[2025-03-08 16:02:10,798 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:02:10,798 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:02:10,798 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:02:10,800 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:02:10,801 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2025-03-08 16:02:10,849 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-08 16:02:11,066 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-08 16:02:11,066 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:02:11,066 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:02:11,079 INFO  L256         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:02:11,083 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:02:11,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked.
[2025-03-08 16:02:11,112 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:02:11,112 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:02:11,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255097887]
[2025-03-08 16:02:11,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [255097887] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:02:11,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:02:11,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 16:02:11,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105352255]
[2025-03-08 16:02:11,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:02:11,117 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:02:11,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:02:11,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:02:11,131 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:02:11,132 INFO  L87              Difference]: Start difference. First operand  has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand  has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-08 16:02:11,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:02:11,145 INFO  L93              Difference]: Finished difference Result 90 states and 148 transitions.
[2025-03-08 16:02:11,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:02:11,146 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98
[2025-03-08 16:02:11,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:02:11,149 INFO  L225             Difference]: With dead ends: 90
[2025-03-08 16:02:11,149 INFO  L226             Difference]: Without dead ends: 45
[2025-03-08 16:02:11,151 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:02:11,153 INFO  L435           NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:02:11,153 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:02:11,161 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2025-03-08 16:02:11,171 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2025-03-08 16:02:11,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-03-08 16:02:11,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions.
[2025-03-08 16:02:11,176 INFO  L78                 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 98
[2025-03-08 16:02:11,177 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:02:11,177 INFO  L471      AbstractCegarLoop]: Abstraction has 45 states and 63 transitions.
[2025-03-08 16:02:11,177 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-08 16:02:11,177 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions.
[2025-03-08 16:02:11,179 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-08 16:02:11,179 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:02:11,179 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:02:11,189 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2025-03-08 16:02:11,379 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:02:11,380 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:02:11,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:02:11,380 INFO  L85        PathProgramCache]: Analyzing trace with hash -121078685, now seen corresponding path program 1 times
[2025-03-08 16:02:11,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:02:11,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602447120]
[2025-03-08 16:02:11,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:02:11,381 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:02:11,381 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:02:11,383 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:02:11,384 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2025-03-08 16:02:11,415 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:02:11,618 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:02:11,618 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:02:11,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:02:11,627 INFO  L256         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-08 16:02:11,633 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:02:11,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-08 16:02:11,743 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:02:11,743 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:02:11,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602447120]
[2025-03-08 16:02:11,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [602447120] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:02:11,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:02:11,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:02:11,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74526370]
[2025-03-08 16:02:11,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:02:11,744 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:02:11,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:02:11,745 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:02:11,745 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:02:11,745 INFO  L87              Difference]: Start difference. First operand 45 states and 63 transitions. Second operand  has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:02:13,079 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:02:14,722 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:02:16,309 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-08 16:02:16,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:02:16,309 INFO  L93              Difference]: Finished difference Result 171 states and 243 transitions.
[2025-03-08 16:02:16,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:02:16,326 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99
[2025-03-08 16:02:16,327 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:02:16,328 INFO  L225             Difference]: With dead ends: 171
[2025-03-08 16:02:16,328 INFO  L226             Difference]: Without dead ends: 129
[2025-03-08 16:02:16,328 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:02:16,329 INFO  L435           NwaCegarLoop]: 104 mSDtfsCounter, 115 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time
[2025-03-08 16:02:16,329 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 229 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time]
[2025-03-08 16:02:16,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-03-08 16:02:16,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125.
[2025-03-08 16:02:16,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-08 16:02:16,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions.
[2025-03-08 16:02:16,349 INFO  L78                 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 99
[2025-03-08 16:02:16,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:02:16,350 INFO  L471      AbstractCegarLoop]: Abstraction has 125 states and 180 transitions.
[2025-03-08 16:02:16,350 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-08 16:02:16,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions.
[2025-03-08 16:02:16,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-08 16:02:16,351 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:02:16,351 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:02:16,362 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2025-03-08 16:02:16,551 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:02:16,551 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:02:16,551 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:02:16,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 1621731650, now seen corresponding path program 1 times
[2025-03-08 16:02:16,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:02:16,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816798853]
[2025-03-08 16:02:16,552 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:02:16,552 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:02:16,552 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:02:16,555 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:02:16,555 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2025-03-08 16:02:16,586 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 16:02:16,783 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 16:02:16,783 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:02:16,783 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:02:16,792 INFO  L256         TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-08 16:02:16,796 INFO  L279         TraceCheckSpWp]: Computing forward predicates...