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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.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 f0881add29b2e913dccd0b5d11f581533e2263693d3a446dde3d837a9a510a5a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 23:52:29,670 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 23:52:29,728 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 23:52:29,734 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 23:52:29,734 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 23:52:29,755 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 23:52:29,755 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 23:52:29,756 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 23:52:29,756 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 23:52:29,756 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 23:52:29,757 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 23:52:29,757 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 23:52:29,757 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 23:52:29,757 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 23:52:29,757 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 23:52:29,758 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 23:52:29,758 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 23:52:29,759 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 23:52:29,759 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 23:52:29,759 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 23:52:29,759 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 23:52:29,759 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 23:52:29,759 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 23:52:29,759 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 23:52:29,759 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 23:52:29,760 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 23:52:29,760 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 23:52:29,760 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 -> f0881add29b2e913dccd0b5d11f581533e2263693d3a446dde3d837a9a510a5a
[2025-03-03 23:52:29,989 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 23:52:29,997 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 23:52:29,999 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 23:52:30,000 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 23:52:30,000 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 23:52:30,002 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i
[2025-03-03 23:52:31,173 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4dabf76/d3f7d4e32cfa4a84a1c56b728ae904d9/FLAG1c36bd455
[2025-03-03 23:52:31,405 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 23:52:31,406 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i
[2025-03-03 23:52:31,414 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4dabf76/d3f7d4e32cfa4a84a1c56b728ae904d9/FLAG1c36bd455
[2025-03-03 23:52:31,430 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e4dabf76/d3f7d4e32cfa4a84a1c56b728ae904d9
[2025-03-03 23:52:31,432 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 23:52:31,432 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 23:52:31,433 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 23:52:31,433 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 23:52:31,437 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 23:52:31,438 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,440 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37105b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31, skipping insertion in model container
[2025-03-03 23:52:31,440 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,461 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 23:52:31,559 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_operatoramount_amount100_file-22.i[916,929]
[2025-03-03 23:52:31,633 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 23:52:31,648 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 23:52:31,656 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_operatoramount_amount100_file-22.i[916,929]
[2025-03-03 23:52:31,695 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 23:52:31,714 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 23:52:31,714 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31 WrapperNode
[2025-03-03 23:52:31,715 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 23:52:31,716 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 23:52:31,716 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 23:52:31,716 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 23:52:31,720 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,729 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,763 INFO  L138                Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 254
[2025-03-03 23:52:31,763 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 23:52:31,764 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 23:52:31,764 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 23:52:31,764 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 23:52:31,770 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,770 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,777 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,803 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 23:52:31,803 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,803 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,816 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,821 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,825 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,827 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,834 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 23:52:31,836 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 23:52:31,837 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 23:52:31,837 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 23:52:31,838 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (1/1) ...
[2025-03-03 23:52:31,841 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 23:52:31,850 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:52:31,870 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 23:52:31,873 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 23:52:31,889 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 23:52:31,889 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 23:52:31,889 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 23:52:31,889 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 23:52:31,889 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 23:52:31,889 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 23:52:31,956 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 23:52:31,957 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 23:52:32,372 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~bitwise22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1;
[2025-03-03 23:52:32,406 INFO  L?                        ?]: Removed 23 outVars from TransFormulas that were not future-live.
[2025-03-03 23:52:32,406 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 23:52:32,423 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 23:52:32,424 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 23:52:32,424 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:52:32 BoogieIcfgContainer
[2025-03-03 23:52:32,424 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 23:52:32,426 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 23:52:32,426 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 23:52:32,429 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 23:52:32,429 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:52:31" (1/3) ...
[2025-03-03 23:52:32,430 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64de8820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:52:32, skipping insertion in model container
[2025-03-03 23:52:32,430 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:52:31" (2/3) ...
[2025-03-03 23:52:32,431 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64de8820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:52:32, skipping insertion in model container
[2025-03-03 23:52:32,431 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:52:32" (3/3) ...
[2025-03-03 23:52:32,432 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-22.i
[2025-03-03 23:52:32,442 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 23:52:32,444 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-22.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 23:52:32,502 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 23:52:32,513 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;@43379d06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 23:52:32,514 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 23:52:32,518 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 101 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2025-03-03 23:52:32,529 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 201
[2025-03-03 23:52:32,529 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:32,530 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:32,531 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:32,534 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:32,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -1933293176, now seen corresponding path program 1 times
[2025-03-03 23:52:32,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:32,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562455811]
[2025-03-03 23:52:32,541 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:32,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:32,614 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-03 23:52:32,642 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-03 23:52:32,643 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:32,643 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:32,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked.
[2025-03-03 23:52:32,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:32,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562455811]
[2025-03-03 23:52:32,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562455811] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 23:52:32,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997028267]
[2025-03-03 23:52:32,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:32,830 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:52:32,830 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:52:32,836 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 23:52:32,837 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 23:52:32,924 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-03 23:52:33,007 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-03 23:52:33,007 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:33,008 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:33,011 INFO  L256         TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 23:52:33,020 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:52:33,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked.
[2025-03-03 23:52:33,048 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:52:33,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [997028267] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:33,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 23:52:33,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 23:52:33,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008096147]
[2025-03-03 23:52:33,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:33,053 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 23:52:33,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:33,068 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 23:52:33,069 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 23:52:33,071 INFO  L87              Difference]: Start difference. First operand  has 101 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-03-03 23:52:33,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:33,105 INFO  L93              Difference]: Finished difference Result 196 states and 340 transitions.
[2025-03-03 23:52:33,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 23:52:33,108 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 200
[2025-03-03 23:52:33,108 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:33,115 INFO  L225             Difference]: With dead ends: 196
[2025-03-03 23:52:33,115 INFO  L226             Difference]: Without dead ends: 98
[2025-03-03 23:52:33,118 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 23:52:33,119 INFO  L435           NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:33,120 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 23:52:33,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-03-03 23:52:33,151 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2025-03-03 23:52:33,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2025-03-03 23:52:33,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions.
[2025-03-03 23:52:33,160 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 200
[2025-03-03 23:52:33,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:33,160 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 152 transitions.
[2025-03-03 23:52:33,160 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-03-03 23:52:33,161 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions.
[2025-03-03 23:52:33,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 201
[2025-03-03 23:52:33,163 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:33,163 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:33,171 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 23:52:33,364 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-03 23:52:33,364 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:33,365 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:33,365 INFO  L85        PathProgramCache]: Analyzing trace with hash 1087999273, now seen corresponding path program 1 times
[2025-03-03 23:52:33,365 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:33,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475774561]
[2025-03-03 23:52:33,365 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:33,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:33,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-03 23:52:33,479 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-03 23:52:33,483 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:33,483 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:33,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:52:33,815 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:33,815 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475774561]
[2025-03-03 23:52:33,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475774561] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:33,815 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:33,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 23:52:33,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95724643]
[2025-03-03 23:52:33,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:33,816 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 23:52:33,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:33,817 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 23:52:33,818 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:52:33,818 INFO  L87              Difference]: Start difference. First operand 98 states and 152 transitions. Second operand  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:34,081 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:34,081 INFO  L93              Difference]: Finished difference Result 321 states and 499 transitions.
[2025-03-03 23:52:34,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 23:52:34,082 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200
[2025-03-03 23:52:34,082 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:34,084 INFO  L225             Difference]: With dead ends: 321
[2025-03-03 23:52:34,084 INFO  L226             Difference]: Without dead ends: 226
[2025-03-03 23:52:34,087 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 23:52:34,089 INFO  L435           NwaCegarLoop]: 135 mSDtfsCounter, 198 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:34,089 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 536 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 23:52:34,090 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2025-03-03 23:52:34,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211.
[2025-03-03 23:52:34,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 211 states, 146 states have (on average 1.4109589041095891) internal successors, (206), 146 states have internal predecessors, (206), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62)
[2025-03-03 23:52:34,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 330 transitions.
[2025-03-03 23:52:34,124 INFO  L78                 Accepts]: Start accepts. Automaton has 211 states and 330 transitions. Word has length 200
[2025-03-03 23:52:34,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:34,126 INFO  L471      AbstractCegarLoop]: Abstraction has 211 states and 330 transitions.
[2025-03-03 23:52:34,126 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:34,127 INFO  L276                IsEmpty]: Start isEmpty. Operand 211 states and 330 transitions.
[2025-03-03 23:52:34,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2025-03-03 23:52:34,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:34,129 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:34,129 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 23:52:34,129 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:34,132 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:34,133 INFO  L85        PathProgramCache]: Analyzing trace with hash 1514870225, now seen corresponding path program 1 times
[2025-03-03 23:52:34,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:34,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733524352]
[2025-03-03 23:52:34,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:34,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:34,153 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes.
[2025-03-03 23:52:34,195 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements.
[2025-03-03 23:52:34,195 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:34,195 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:34,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:52:34,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:34,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733524352]
[2025-03-03 23:52:34,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733524352] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:34,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:34,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 23:52:34,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954537952]
[2025-03-03 23:52:34,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:34,496 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 23:52:34,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:34,498 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 23:52:34,498 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 23:52:34,499 INFO  L87              Difference]: Start difference. First operand 211 states and 330 transitions. Second operand  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:34,812 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:34,813 INFO  L93              Difference]: Finished difference Result 564 states and 875 transitions.
[2025-03-03 23:52:34,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 23:52:34,813 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201
[2025-03-03 23:52:34,814 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:34,819 INFO  L225             Difference]: With dead ends: 564
[2025-03-03 23:52:34,820 INFO  L226             Difference]: Without dead ends: 356
[2025-03-03 23:52:34,821 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-03 23:52:34,823 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 177 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:34,823 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 630 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 23:52:34,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 356 states.
[2025-03-03 23:52:34,856 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 304.
[2025-03-03 23:52:34,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 304 states, 207 states have (on average 1.391304347826087) internal successors, (288), 207 states have internal predecessors, (288), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93)
[2025-03-03 23:52:34,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 474 transitions.
[2025-03-03 23:52:34,862 INFO  L78                 Accepts]: Start accepts. Automaton has 304 states and 474 transitions. Word has length 201
[2025-03-03 23:52:34,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:34,863 INFO  L471      AbstractCegarLoop]: Abstraction has 304 states and 474 transitions.
[2025-03-03 23:52:34,864 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:34,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 304 states and 474 transitions.
[2025-03-03 23:52:34,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2025-03-03 23:52:34,866 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:34,866 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:34,867 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 23:52:34,867 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:34,867 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:34,868 INFO  L85        PathProgramCache]: Analyzing trace with hash 1726221138, now seen corresponding path program 1 times
[2025-03-03 23:52:34,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:34,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135812866]
[2025-03-03 23:52:34,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:34,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:34,884 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes.
[2025-03-03 23:52:34,915 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements.
[2025-03-03 23:52:34,915 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:34,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:35,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:52:35,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:35,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135812866]
[2025-03-03 23:52:35,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135812866] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:35,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:35,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 23:52:35,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787398577]
[2025-03-03 23:52:35,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:35,313 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 23:52:35,313 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:35,315 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 23:52:35,316 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 23:52:35,316 INFO  L87              Difference]: Start difference. First operand 304 states and 474 transitions. Second operand  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:35,568 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:35,568 INFO  L93              Difference]: Finished difference Result 748 states and 1161 transitions.
[2025-03-03 23:52:35,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 23:52:35,568 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201
[2025-03-03 23:52:35,569 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:35,573 INFO  L225             Difference]: With dead ends: 748
[2025-03-03 23:52:35,573 INFO  L226             Difference]: Without dead ends: 447
[2025-03-03 23:52:35,575 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:52:35,575 INFO  L435           NwaCegarLoop]: 137 mSDtfsCounter, 104 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:35,575 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 402 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 23:52:35,576 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 447 states.
[2025-03-03 23:52:35,620 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 409.
[2025-03-03 23:52:35,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 409 states, 280 states have (on average 1.4) internal successors, (392), 280 states have internal predecessors, (392), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124)
[2025-03-03 23:52:35,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 640 transitions.
[2025-03-03 23:52:35,627 INFO  L78                 Accepts]: Start accepts. Automaton has 409 states and 640 transitions. Word has length 201
[2025-03-03 23:52:35,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:35,629 INFO  L471      AbstractCegarLoop]: Abstraction has 409 states and 640 transitions.
[2025-03-03 23:52:35,629 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:35,630 INFO  L276                IsEmpty]: Start isEmpty. Operand 409 states and 640 transitions.
[2025-03-03 23:52:35,631 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-03-03 23:52:35,632 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:35,632 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:35,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 23:52:35,632 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:35,633 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:35,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 966426174, now seen corresponding path program 1 times
[2025-03-03 23:52:35,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:35,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368956176]
[2025-03-03 23:52:35,633 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:35,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:35,649 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-03-03 23:52:35,671 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-03-03 23:52:35,673 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:35,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:35,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:52:35,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:35,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368956176]
[2025-03-03 23:52:35,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368956176] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:35,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:35,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 23:52:35,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297896444]
[2025-03-03 23:52:35,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:35,906 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 23:52:35,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:35,907 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 23:52:35,907 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 23:52:35,907 INFO  L87              Difference]: Start difference. First operand 409 states and 640 transitions. Second operand  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:36,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:36,234 INFO  L93              Difference]: Finished difference Result 806 states and 1256 transitions.
[2025-03-03 23:52:36,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 23:52:36,235 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205
[2025-03-03 23:52:36,235 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:36,237 INFO  L225             Difference]: With dead ends: 806
[2025-03-03 23:52:36,238 INFO  L226             Difference]: Without dead ends: 461
[2025-03-03 23:52:36,238 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-03 23:52:36,239 INFO  L435           NwaCegarLoop]: 149 mSDtfsCounter, 171 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:36,240 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 635 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 23:52:36,241 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 461 states.
[2025-03-03 23:52:36,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 408.
[2025-03-03 23:52:36,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 408 states, 279 states have (on average 1.3942652329749103) internal successors, (389), 279 states have internal predecessors, (389), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124)
[2025-03-03 23:52:36,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 637 transitions.
[2025-03-03 23:52:36,289 INFO  L78                 Accepts]: Start accepts. Automaton has 408 states and 637 transitions. Word has length 205
[2025-03-03 23:52:36,289 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:36,290 INFO  L471      AbstractCegarLoop]: Abstraction has 408 states and 637 transitions.
[2025-03-03 23:52:36,290 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:36,290 INFO  L276                IsEmpty]: Start isEmpty. Operand 408 states and 637 transitions.
[2025-03-03 23:52:36,291 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-03-03 23:52:36,291 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:36,291 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:36,291 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 23:52:36,291 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:36,292 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:36,292 INFO  L85        PathProgramCache]: Analyzing trace with hash -2083776641, now seen corresponding path program 1 times
[2025-03-03 23:52:36,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:36,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859732497]
[2025-03-03 23:52:36,292 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:36,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:36,308 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-03-03 23:52:36,378 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-03-03 23:52:36,379 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:36,379 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:37,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:52:37,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:37,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859732497]
[2025-03-03 23:52:37,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859732497] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:37,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:37,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 23:52:37,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582297701]
[2025-03-03 23:52:37,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:37,637 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 23:52:37,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:37,637 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 23:52:37,637 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 23:52:37,637 INFO  L87              Difference]: Start difference. First operand 408 states and 637 transitions. Second operand  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:38,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:38,010 INFO  L93              Difference]: Finished difference Result 1052 states and 1645 transitions.
[2025-03-03 23:52:38,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 23:52:38,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205
[2025-03-03 23:52:38,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:38,014 INFO  L225             Difference]: With dead ends: 1052
[2025-03-03 23:52:38,014 INFO  L226             Difference]: Without dead ends: 732
[2025-03-03 23:52:38,016 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 23:52:38,016 INFO  L435           NwaCegarLoop]: 137 mSDtfsCounter, 82 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:38,016 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 464 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 23:52:38,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 732 states.
[2025-03-03 23:52:38,074 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 726.
[2025-03-03 23:52:38,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 726 states, 501 states have (on average 1.3872255489021956) internal successors, (695), 501 states have internal predecessors, (695), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217)
[2025-03-03 23:52:38,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1129 transitions.
[2025-03-03 23:52:38,085 INFO  L78                 Accepts]: Start accepts. Automaton has 726 states and 1129 transitions. Word has length 205
[2025-03-03 23:52:38,086 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:38,086 INFO  L471      AbstractCegarLoop]: Abstraction has 726 states and 1129 transitions.
[2025-03-03 23:52:38,087 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:38,087 INFO  L276                IsEmpty]: Start isEmpty. Operand 726 states and 1129 transitions.
[2025-03-03 23:52:38,089 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-03-03 23:52:38,089 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:38,089 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:38,089 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 23:52:38,089 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:38,090 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:38,090 INFO  L85        PathProgramCache]: Analyzing trace with hash 1705632030, now seen corresponding path program 1 times
[2025-03-03 23:52:38,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:38,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064845363]
[2025-03-03 23:52:38,090 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:38,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:38,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-03-03 23:52:38,148 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-03-03 23:52:38,149 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:38,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:38,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:52:38,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:38,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064845363]
[2025-03-03 23:52:38,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064845363] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:38,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:38,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 23:52:38,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669563273]
[2025-03-03 23:52:38,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:38,448 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 23:52:38,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:38,448 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 23:52:38,449 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:52:38,449 INFO  L87              Difference]: Start difference. First operand 726 states and 1129 transitions. Second operand  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:38,715 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:38,716 INFO  L93              Difference]: Finished difference Result 1759 states and 2728 transitions.
[2025-03-03 23:52:38,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 23:52:38,717 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205
[2025-03-03 23:52:38,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:38,724 INFO  L225             Difference]: With dead ends: 1759
[2025-03-03 23:52:38,724 INFO  L226             Difference]: Without dead ends: 1141
[2025-03-03 23:52:38,726 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 23:52:38,727 INFO  L435           NwaCegarLoop]: 168 mSDtfsCounter, 250 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:38,727 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 512 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 23:52:38,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1141 states.
[2025-03-03 23:52:38,819 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 941.
[2025-03-03 23:52:38,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 941 states, 652 states have (on average 1.3849693251533743) internal successors, (903), 652 states have internal predecessors, (903), 279 states have call successors, (279), 9 states have call predecessors, (279), 9 states have return successors, (279), 279 states have call predecessors, (279), 279 states have call successors, (279)
[2025-03-03 23:52:38,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1461 transitions.
[2025-03-03 23:52:38,827 INFO  L78                 Accepts]: Start accepts. Automaton has 941 states and 1461 transitions. Word has length 205
[2025-03-03 23:52:38,827 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:38,828 INFO  L471      AbstractCegarLoop]: Abstraction has 941 states and 1461 transitions.
[2025-03-03 23:52:38,828 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:38,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 941 states and 1461 transitions.
[2025-03-03 23:52:38,829 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-03-03 23:52:38,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:38,829 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:38,829 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 23:52:38,830 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:38,830 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:38,830 INFO  L85        PathProgramCache]: Analyzing trace with hash -1700744031, now seen corresponding path program 1 times
[2025-03-03 23:52:38,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:38,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621596062]
[2025-03-03 23:52:38,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:38,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:38,841 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-03 23:52:38,849 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-03 23:52:38,849 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:38,849 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:38,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:52:38,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:38,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621596062]
[2025-03-03 23:52:38,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621596062] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:52:38,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:52:38,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 23:52:38,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224837552]
[2025-03-03 23:52:38,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:52:38,898 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 23:52:38,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:38,898 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 23:52:38,898 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 23:52:38,898 INFO  L87              Difference]: Start difference. First operand 941 states and 1461 transitions. Second operand  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:38,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:52:38,997 INFO  L93              Difference]: Finished difference Result 2249 states and 3469 transitions.
[2025-03-03 23:52:39,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 23:52:39,001 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206
[2025-03-03 23:52:39,002 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:52:39,009 INFO  L225             Difference]: With dead ends: 2249
[2025-03-03 23:52:39,010 INFO  L226             Difference]: Without dead ends: 1378
[2025-03-03 23:52:39,012 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 23:52:39,013 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 51 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 23:52:39,014 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 291 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 23:52:39,015 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1378 states.
[2025-03-03 23:52:39,116 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1235.
[2025-03-03 23:52:39,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1235 states, 946 states have (on average 1.4164904862579282) internal successors, (1340), 946 states have internal predecessors, (1340), 279 states have call successors, (279), 9 states have call predecessors, (279), 9 states have return successors, (279), 279 states have call predecessors, (279), 279 states have call successors, (279)
[2025-03-03 23:52:39,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1898 transitions.
[2025-03-03 23:52:39,126 INFO  L78                 Accepts]: Start accepts. Automaton has 1235 states and 1898 transitions. Word has length 206
[2025-03-03 23:52:39,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:52:39,126 INFO  L471      AbstractCegarLoop]: Abstraction has 1235 states and 1898 transitions.
[2025-03-03 23:52:39,126 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:52:39,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 1235 states and 1898 transitions.
[2025-03-03 23:52:39,128 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-03-03 23:52:39,128 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:52:39,128 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:52:39,128 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 23:52:39,128 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:52:39,129 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:52:39,129 INFO  L85        PathProgramCache]: Analyzing trace with hash 2083689088, now seen corresponding path program 1 times
[2025-03-03 23:52:39,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:52:39,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067288634]
[2025-03-03 23:52:39,129 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:39,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:52:39,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-03 23:52:39,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-03 23:52:39,423 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:39,423 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-03 23:52:39,426 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437165563]
[2025-03-03 23:52:39,426 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:52:39,426 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:52:39,426 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:52:39,428 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 23:52:39,429 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 23:52:39,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-03 23:52:39,597 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-03 23:52:39,598 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:52:39,598 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:52:39,601 INFO  L256         TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 82 conjuncts are in the unsatisfiable core
[2025-03-03 23:52:39,610 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:52:43,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 1543 proven. 123 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked.
[2025-03-03 23:52:43,961 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 23:52:56,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:52:56,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067288634]
[2025-03-03 23:52:56,422 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-03-03 23:52:56,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437165563]
[2025-03-03 23:52:56,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [437165563] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 23:52:56,422 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2025-03-03 23:52:56,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49
[2025-03-03 23:52:56,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304172089]
[2025-03-03 23:52:56,423 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2025-03-03 23:52:56,423 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2025-03-03 23:52:56,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:52:56,424 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2025-03-03 23:52:56,425 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=3006, Unknown=0, NotChecked=0, Total=3660
[2025-03-03 23:52:56,426 INFO  L87              Difference]: Start difference. First operand 1235 states and 1898 transitions. Second operand  has 50 states, 50 states have (on average 2.1) internal successors, (105), 43 states have internal predecessors, (105), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31)
[2025-03-03 23:53:00,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:00,182 INFO  L93              Difference]: Finished difference Result 2226 states and 3277 transitions.
[2025-03-03 23:53:00,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. 
[2025-03-03 23:53:00,182 INFO  L78                 Accepts]: Start accepts. Automaton has  has 50 states, 50 states have (on average 2.1) internal successors, (105), 43 states have internal predecessors, (105), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) Word has length 206
[2025-03-03 23:53:00,183 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:00,195 INFO  L225             Difference]: With dead ends: 2226
[2025-03-03 23:53:00,196 INFO  L226             Difference]: Without dead ends: 1948
[2025-03-03 23:53:00,200 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3499 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=2264, Invalid=10618, Unknown=0, NotChecked=0, Total=12882
[2025-03-03 23:53:00,202 INFO  L435           NwaCegarLoop]: 185 mSDtfsCounter, 769 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:00,202 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1820 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 23:53:00,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1948 states.
[2025-03-03 23:53:00,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1762.
[2025-03-03 23:53:00,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1762 states, 1337 states have (on average 1.3709798055347793) internal successors, (1833), 1346 states have internal predecessors, (1833), 390 states have call successors, (390), 34 states have call predecessors, (390), 34 states have return successors, (390), 381 states have call predecessors, (390), 390 states have call successors, (390)
[2025-03-03 23:53:00,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2613 transitions.
[2025-03-03 23:53:00,358 INFO  L78                 Accepts]: Start accepts. Automaton has 1762 states and 2613 transitions. Word has length 206
[2025-03-03 23:53:00,358 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:00,358 INFO  L471      AbstractCegarLoop]: Abstraction has 1762 states and 2613 transitions.
[2025-03-03 23:53:00,359 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 50 states, 50 states have (on average 2.1) internal successors, (105), 43 states have internal predecessors, (105), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31)
[2025-03-03 23:53:00,359 INFO  L276                IsEmpty]: Start isEmpty. Operand 1762 states and 2613 transitions.
[2025-03-03 23:53:00,361 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-03-03 23:53:00,361 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:00,361 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:00,368 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-03 23:53:00,565 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,SelfDestructingSolverStorable8
[2025-03-03 23:53:00,565 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:00,565 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:00,565 INFO  L85        PathProgramCache]: Analyzing trace with hash 1578130463, now seen corresponding path program 1 times
[2025-03-03 23:53:00,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:53:00,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758013203]
[2025-03-03 23:53:00,566 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:00,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:53:00,575 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-03 23:53:00,778 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-03 23:53:00,781 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:00,781 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:01,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 492 proven. 60 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked.
[2025-03-03 23:53:01,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:53:01,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758013203]
[2025-03-03 23:53:01,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758013203] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 23:53:01,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335934820]
[2025-03-03 23:53:01,851 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:01,851 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:53:01,851 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:53:01,853 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 23:53:01,855 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 23:53:01,903 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-03 23:53:01,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-03 23:53:01,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:01,969 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:01,972 INFO  L256         TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 48 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:01,977 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:03,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 1205 proven. 60 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked.
[2025-03-03 23:53:03,428 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 23:53:05,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [335934820] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 23:53:05,678 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 23:53:05,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28] total 40
[2025-03-03 23:53:05,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979764284]
[2025-03-03 23:53:05,678 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 23:53:05,679 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2025-03-03 23:53:05,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:53:05,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2025-03-03 23:53:05,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256
[2025-03-03 23:53:05,680 INFO  L87              Difference]: Start difference. First operand 1762 states and 2613 transitions. Second operand  has 40 states, 37 states have (on average 3.081081081081081) internal successors, (114), 33 states have internal predecessors, (114), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 16 states have call predecessors, (62), 14 states have call successors, (62)
[2025-03-03 23:53:08,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:08,585 INFO  L93              Difference]: Finished difference Result 3570 states and 5037 transitions.
[2025-03-03 23:53:08,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. 
[2025-03-03 23:53:08,586 INFO  L78                 Accepts]: Start accepts. Automaton has  has 40 states, 37 states have (on average 3.081081081081081) internal successors, (114), 33 states have internal predecessors, (114), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 16 states have call predecessors, (62), 14 states have call successors, (62) Word has length 206
[2025-03-03 23:53:08,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:08,599 INFO  L225             Difference]: With dead ends: 3570
[2025-03-03 23:53:08,599 INFO  L226             Difference]: Without dead ends: 3062
[2025-03-03 23:53:08,603 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1861, Invalid=7451, Unknown=0, NotChecked=0, Total=9312
[2025-03-03 23:53:08,603 INFO  L435           NwaCegarLoop]: 186 mSDtfsCounter, 476 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:08,603 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1947 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 23:53:08,605 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3062 states.
[2025-03-03 23:53:08,756 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2907.
[2025-03-03 23:53:08,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2907 states, 2185 states have (on average 1.3281464530892448) internal successors, (2902), 2197 states have internal predecessors, (2902), 596 states have call successors, (596), 125 states have call predecessors, (596), 125 states have return successors, (596), 584 states have call predecessors, (596), 596 states have call successors, (596)
[2025-03-03 23:53:08,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 4094 transitions.
[2025-03-03 23:53:08,769 INFO  L78                 Accepts]: Start accepts. Automaton has 2907 states and 4094 transitions. Word has length 206
[2025-03-03 23:53:08,769 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:08,769 INFO  L471      AbstractCegarLoop]: Abstraction has 2907 states and 4094 transitions.
[2025-03-03 23:53:08,770 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 37 states have (on average 3.081081081081081) internal successors, (114), 33 states have internal predecessors, (114), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 16 states have call predecessors, (62), 14 states have call successors, (62)
[2025-03-03 23:53:08,770 INFO  L276                IsEmpty]: Start isEmpty. Operand 2907 states and 4094 transitions.
[2025-03-03 23:53:08,771 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-03-03 23:53:08,771 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:08,772 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:08,779 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-03 23:53:08,972 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:53:08,972 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:08,973 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:08,973 INFO  L85        PathProgramCache]: Analyzing trace with hash 1422137279, now seen corresponding path program 1 times
[2025-03-03 23:53:08,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:53:08,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694121805]
[2025-03-03 23:53:08,973 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:08,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:53:08,982 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-03 23:53:09,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-03 23:53:09,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:09,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:09,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:53:09,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:53:09,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694121805]
[2025-03-03 23:53:09,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694121805] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:53:09,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:53:09,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 23:53:09,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103305989]
[2025-03-03 23:53:09,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:53:09,179 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 23:53:09,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:53:09,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 23:53:09,180 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 23:53:09,180 INFO  L87              Difference]: Start difference. First operand 2907 states and 4094 transitions. Second operand  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:09,372 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:09,373 INFO  L93              Difference]: Finished difference Result 5913 states and 8316 transitions.
[2025-03-03 23:53:09,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 23:53:09,373 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206
[2025-03-03 23:53:09,373 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:09,388 INFO  L225             Difference]: With dead ends: 5913
[2025-03-03 23:53:09,388 INFO  L226             Difference]: Without dead ends: 3382
[2025-03-03 23:53:09,394 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:53:09,396 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 83 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:09,396 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 449 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 23:53:09,399 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3382 states.
[2025-03-03 23:53:09,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 2907.
[2025-03-03 23:53:09,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2907 states, 2185 states have (on average 1.3180778032036613) internal successors, (2880), 2197 states have internal predecessors, (2880), 596 states have call successors, (596), 125 states have call predecessors, (596), 125 states have return successors, (596), 584 states have call predecessors, (596), 596 states have call successors, (596)
[2025-03-03 23:53:09,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 4072 transitions.
[2025-03-03 23:53:09,567 INFO  L78                 Accepts]: Start accepts. Automaton has 2907 states and 4072 transitions. Word has length 206
[2025-03-03 23:53:09,567 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:09,567 INFO  L471      AbstractCegarLoop]: Abstraction has 2907 states and 4072 transitions.
[2025-03-03 23:53:09,567 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:09,567 INFO  L276                IsEmpty]: Start isEmpty. Operand 2907 states and 4072 transitions.
[2025-03-03 23:53:09,570 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-03-03 23:53:09,570 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:09,570 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:09,570 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 23:53:09,571 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:09,571 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:09,571 INFO  L85        PathProgramCache]: Analyzing trace with hash 425064926, now seen corresponding path program 1 times
[2025-03-03 23:53:09,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:53:09,571 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984483741]
[2025-03-03 23:53:09,571 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:09,571 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:53:09,580 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-03 23:53:09,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-03 23:53:09,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:09,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:10,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked.
[2025-03-03 23:53:10,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:53:10,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984483741]
[2025-03-03 23:53:10,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984483741] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 23:53:10,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080755701]
[2025-03-03 23:53:10,127 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:10,127 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:53:10,127 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:53:10,129 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 23:53:10,130 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 23:53:10,183 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-03 23:53:10,290 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-03 23:53:10,290 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:10,290 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:10,296 INFO  L256         TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 23 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:10,301 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:11,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 1194 proven. 27 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked.
[2025-03-03 23:53:11,464 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 23:53:12,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked.
[2025-03-03 23:53:12,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080755701] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 23:53:12,678 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 23:53:12,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 30
[2025-03-03 23:53:12,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898145444]
[2025-03-03 23:53:12,678 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 23:53:12,690 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2025-03-03 23:53:12,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:53:12,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2025-03-03 23:53:12,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870
[2025-03-03 23:53:12,695 INFO  L87              Difference]: Start difference. First operand 2907 states and 4072 transitions. Second operand  has 30 states, 29 states have (on average 5.103448275862069) internal successors, (148), 30 states have internal predecessors, (148), 9 states have call successors, (93), 4 states have call predecessors, (93), 7 states have return successors, (93), 8 states have call predecessors, (93), 9 states have call successors, (93)
[2025-03-03 23:53:14,812 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:14,813 INFO  L93              Difference]: Finished difference Result 6457 states and 9062 transitions.
[2025-03-03 23:53:14,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2025-03-03 23:53:14,814 INFO  L78                 Accepts]: Start accepts. Automaton has  has 30 states, 29 states have (on average 5.103448275862069) internal successors, (148), 30 states have internal predecessors, (148), 9 states have call successors, (93), 4 states have call predecessors, (93), 7 states have return successors, (93), 8 states have call predecessors, (93), 9 states have call successors, (93) Word has length 206
[2025-03-03 23:53:14,814 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:14,833 INFO  L225             Difference]: With dead ends: 6457
[2025-03-03 23:53:14,833 INFO  L226             Difference]: Without dead ends: 4090
[2025-03-03 23:53:14,840 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=603, Invalid=2153, Unknown=0, NotChecked=0, Total=2756
[2025-03-03 23:53:14,841 INFO  L435           NwaCegarLoop]: 117 mSDtfsCounter, 547 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:14,841 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1330 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 23:53:14,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4090 states.
[2025-03-03 23:53:15,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 2871.
[2025-03-03 23:53:15,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2871 states, 2147 states have (on average 1.3134606427573359) internal successors, (2820), 2159 states have internal predecessors, (2820), 596 states have call successors, (596), 127 states have call predecessors, (596), 127 states have return successors, (596), 584 states have call predecessors, (596), 596 states have call successors, (596)
[2025-03-03 23:53:15,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 4012 transitions.
[2025-03-03 23:53:15,209 INFO  L78                 Accepts]: Start accepts. Automaton has 2871 states and 4012 transitions. Word has length 206
[2025-03-03 23:53:15,210 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:15,210 INFO  L471      AbstractCegarLoop]: Abstraction has 2871 states and 4012 transitions.
[2025-03-03 23:53:15,210 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 29 states have (on average 5.103448275862069) internal successors, (148), 30 states have internal predecessors, (148), 9 states have call successors, (93), 4 states have call predecessors, (93), 7 states have return successors, (93), 8 states have call predecessors, (93), 9 states have call successors, (93)
[2025-03-03 23:53:15,210 INFO  L276                IsEmpty]: Start isEmpty. Operand 2871 states and 4012 transitions.
[2025-03-03 23:53:15,213 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2025-03-03 23:53:15,214 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:15,214 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:15,221 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-03 23:53:15,414 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:53:15,415 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:15,415 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:15,415 INFO  L85        PathProgramCache]: Analyzing trace with hash -2089203221, now seen corresponding path program 1 times
[2025-03-03 23:53:15,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:53:15,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241524904]
[2025-03-03 23:53:15,416 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:15,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:53:15,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-03-03 23:53:15,439 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-03-03 23:53:15,440 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:15,440 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:15,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:53:15,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 23:53:15,489 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241524904]
[2025-03-03 23:53:15,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241524904] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:53:15,489 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:53:15,489 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 23:53:15,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323456985]
[2025-03-03 23:53:15,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:53:15,491 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 23:53:15,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 23:53:15,491 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 23:53:15,491 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 23:53:15,491 INFO  L87              Difference]: Start difference. First operand 2871 states and 4012 transitions. Second operand  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:15,755 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:15,755 INFO  L93              Difference]: Finished difference Result 5606 states and 7859 transitions.
[2025-03-03 23:53:15,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 23:53:15,756 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207
[2025-03-03 23:53:15,756 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:15,771 INFO  L225             Difference]: With dead ends: 5606
[2025-03-03 23:53:15,771 INFO  L226             Difference]: Without dead ends: 3207
[2025-03-03 23:53:15,777 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 23:53:15,778 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 53 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:15,778 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 317 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 23:53:15,781 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3207 states.
[2025-03-03 23:53:15,999 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2995.
[2025-03-03 23:53:16,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2995 states, 2271 states have (on average 1.3130779392338177) internal successors, (2982), 2283 states have internal predecessors, (2982), 596 states have call successors, (596), 127 states have call predecessors, (596), 127 states have return successors, (596), 584 states have call predecessors, (596), 596 states have call successors, (596)
[2025-03-03 23:53:16,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 4174 transitions.
[2025-03-03 23:53:16,019 INFO  L78                 Accepts]: Start accepts. Automaton has 2995 states and 4174 transitions. Word has length 207
[2025-03-03 23:53:16,019 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:16,019 INFO  L471      AbstractCegarLoop]: Abstraction has 2995 states and 4174 transitions.
[2025-03-03 23:53:16,019 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:16,020 INFO  L276                IsEmpty]: Start isEmpty. Operand 2995 states and 4174 transitions.
[2025-03-03 23:53:16,021 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2025-03-03 23:53:16,022 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:16,022 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:16,022 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 23:53:16,022 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:16,023 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:16,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -1396101524, now seen corresponding path program 1 times
[2025-03-03 23:53:16,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 23:53:16,023 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000999252]
[2025-03-03 23:53:16,023 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:16,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 23:53:16,032 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-03-03 23:53:16,144 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-03-03 23:53:16,144 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:16,145 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-03 23:53:16,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129251047]
[2025-03-03 23:53:16,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:16,147 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 23:53:16,147 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:53:16,149 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 23:53:16,185 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 23:53:16,237 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-03-03 23:53:16,303 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-03-03 23:53:16,303 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:16,303 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 23:53:16,303 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-03 23:53:16,326 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-03-03 23:53:16,399 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-03-03 23:53:16,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:16,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 23:53:16,519 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-03 23:53:16,520 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-03 23:53:16,520 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 23:53:16,530 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-03 23:53:16,722 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-03-03 23:53:16,725 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:16,847 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 23:53:16,849 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:53:16 BoogieIcfgContainer
[2025-03-03 23:53:16,850 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 23:53:16,850 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 23:53:16,850 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 23:53:16,850 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 23:53:16,851 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:52:32" (3/4) ...
[2025-03-03 23:53:16,852 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-03 23:53:16,853 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 23:53:16,854 INFO  L158              Benchmark]: Toolchain (without parser) took 45421.11ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.4MB in the beginning and 270.4MB in the end (delta: -158.1MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB.
[2025-03-03 23:53:16,854 INFO  L158              Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 23:53:16,854 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 282.12ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 23:53:16,854 INFO  L158              Benchmark]: Boogie Procedure Inliner took 47.27ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 89.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 23:53:16,854 INFO  L158              Benchmark]: Boogie Preprocessor took 71.28ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 79.2MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 23:53:16,854 INFO  L158              Benchmark]: IcfgBuilder took 587.80ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 43.5MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-03 23:53:16,855 INFO  L158              Benchmark]: TraceAbstraction took 44424.03ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 42.6MB in the beginning and 270.5MB in the end (delta: -227.9MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB.
[2025-03-03 23:53:16,855 INFO  L158              Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 402.7MB. Free memory was 270.5MB in the beginning and 270.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 23:53:16,856 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 282.12ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 47.27ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 89.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 71.28ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 79.2MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 587.80ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 43.5MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 44424.03ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 42.6MB in the beginning and 270.5MB in the end (delta: -227.9MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB.
 * Witness Printer took 2.88ms. Allocated memory is still 402.7MB. Free memory was 270.5MB in the beginning and 270.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 204, overapproximation of bitwiseOr at line 79, overapproximation of bitwiseOr at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 204. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    unsigned short int var_1_1 = 32;
[L23]                    signed short int var_1_6 = -1;
[L24]                    unsigned char var_1_7 = 1;
[L25]                    unsigned char var_1_8 = 1;
[L26]                    signed char var_1_9 = -128;
[L27]                    signed char var_1_12 = 10;
[L28]                    signed char var_1_13 = -64;
[L29]                    signed char var_1_14 = 1;
[L30]                    signed char var_1_15 = -25;
[L31]                    unsigned short int var_1_16 = 256;
[L32]                    signed char var_1_18 = 4;
[L33]                    float var_1_19 = 100.5;
[L34]                    float var_1_20 = 4.5;
[L35]                    signed char var_1_21 = 0;
[L36]                    signed char var_1_22 = 64;
[L37]                    signed char var_1_23 = 2;
[L38]                    signed char var_1_24 = 4;
[L39]                    unsigned long int var_1_25 = 8;
[L40]                    unsigned char var_1_27 = 50;
[L41]                    unsigned char var_1_28 = 5;
[L42]                    signed short int var_1_29 = 32;
[L43]                    signed long int var_1_30 = 1;
[L44]                    signed long int var_1_31 = 0;
[L45]                    unsigned char var_1_33 = 2;
[L46]                    unsigned char var_1_34 = 128;
[L47]                    unsigned char var_1_35 = 2;
[L48]                    unsigned char var_1_36 = 200;
[L49]                    unsigned char var_1_37 = 32;
[L50]                    double var_1_38 = 10.3;
[L51]                    signed short int var_1_39 = -256;
[L52]                    signed short int last_1_var_1_6 = -1;
[L53]                    signed char last_1_var_1_9 = -128;
[L54]                    unsigned short int last_1_var_1_16 = 256;
[L55]                    signed char last_1_var_1_18 = 4;
[L56]                    float last_1_var_1_19 = 100.5;
[L57]                    unsigned long int last_1_var_1_25 = 8;
[L58]                    unsigned char last_1_var_1_27 = 50;
[L59]                    signed short int last_1_var_1_29 = 32;
[L60]                    unsigned char last_1_var_1_33 = 2;
[L61]                    unsigned char last_1_var_1_35 = 2;
             VAL         [isInitial=0, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128]
[L208]                   isInitial = 1
[L209]       FCALL       initially()
[L210]       COND TRUE   1
[L211]       CALL        updateLastVariables()
[L192]                   last_1_var_1_6 = var_1_6
[L193]                   last_1_var_1_9 = var_1_9
[L194]                   last_1_var_1_16 = var_1_16
[L195]                   last_1_var_1_18 = var_1_18
[L196]                   last_1_var_1_19 = var_1_19
[L197]                   last_1_var_1_25 = var_1_25
[L198]                   last_1_var_1_27 = var_1_27
[L199]                   last_1_var_1_29 = var_1_29
[L200]                   last_1_var_1_33 = var_1_33
[L201]                   last_1_var_1_35 = var_1_35
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128]
[L211]       RET         updateLastVariables()
[L212]       CALL        updateVariables()
[L143]                   var_1_7 = __VERIFIER_nondet_uchar()
[L144]       CALL        assume_abort_if_not(var_1_7 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128]
[L144]       RET         assume_abort_if_not(var_1_7 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128]
[L145]       CALL        assume_abort_if_not(var_1_7 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L145]       RET         assume_abort_if_not(var_1_7 <= 1)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L146]                   var_1_8 = __VERIFIER_nondet_uchar()
[L147]       CALL        assume_abort_if_not(var_1_8 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128]
[L147]       RET         assume_abort_if_not(var_1_8 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128]
[L148]       CALL        assume_abort_if_not(var_1_8 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L148]       RET         assume_abort_if_not(var_1_8 <= 1)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L149]                   var_1_12 = __VERIFIER_nondet_char()
[L150]       CALL        assume_abort_if_not(var_1_12 >= -127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L150]       RET         assume_abort_if_not(var_1_12 >= -127)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L151]       CALL        assume_abort_if_not(var_1_12 <= 126)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L151]       RET         assume_abort_if_not(var_1_12 <= 126)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L152]                   var_1_13 = __VERIFIER_nondet_char()
[L153]       CALL        assume_abort_if_not(var_1_13 >= -127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L153]       RET         assume_abort_if_not(var_1_13 >= -127)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L154]       CALL        assume_abort_if_not(var_1_13 <= 126)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L154]       RET         assume_abort_if_not(var_1_13 <= 126)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L155]                   var_1_14 = __VERIFIER_nondet_char()
[L156]       CALL        assume_abort_if_not(var_1_14 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L156]       RET         assume_abort_if_not(var_1_14 >= -63)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L157]       CALL        assume_abort_if_not(var_1_14 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L157]       RET         assume_abort_if_not(var_1_14 <= 63)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L158]                   var_1_15 = __VERIFIER_nondet_char()
[L159]       CALL        assume_abort_if_not(var_1_15 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L159]       RET         assume_abort_if_not(var_1_15 >= -63)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L160]       CALL        assume_abort_if_not(var_1_15 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L160]       RET         assume_abort_if_not(var_1_15 <= 63)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L161]                   var_1_20 = __VERIFIER_nondet_float()
[L162]       CALL        assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L162]       RET         assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L163]                   var_1_22 = __VERIFIER_nondet_char()
[L164]       CALL        assume_abort_if_not(var_1_22 >= -1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L164]       RET         assume_abort_if_not(var_1_22 >= -1)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L165]       CALL        assume_abort_if_not(var_1_22 <= 126)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L165]       RET         assume_abort_if_not(var_1_22 <= 126)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L166]                   var_1_23 = __VERIFIER_nondet_char()
[L167]       CALL        assume_abort_if_not(var_1_23 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L167]       RET         assume_abort_if_not(var_1_23 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L168]       CALL        assume_abort_if_not(var_1_23 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L168]       RET         assume_abort_if_not(var_1_23 <= 63)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L169]                   var_1_24 = __VERIFIER_nondet_char()
[L170]       CALL        assume_abort_if_not(var_1_24 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L170]       RET         assume_abort_if_not(var_1_24 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L171]       CALL        assume_abort_if_not(var_1_24 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L171]       RET         assume_abort_if_not(var_1_24 <= 63)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L172]                   var_1_28 = __VERIFIER_nondet_uchar()
[L173]       CALL        assume_abort_if_not(var_1_28 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L173]       RET         assume_abort_if_not(var_1_28 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L174]       CALL        assume_abort_if_not(var_1_28 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L174]       RET         assume_abort_if_not(var_1_28 <= 127)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L175]                   var_1_30 = __VERIFIER_nondet_long()
[L176]       CALL        assume_abort_if_not(var_1_30 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L176]       RET         assume_abort_if_not(var_1_30 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L177]       CALL        assume_abort_if_not(var_1_30 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L177]       RET         assume_abort_if_not(var_1_30 <= 1)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L178]                   var_1_31 = __VERIFIER_nondet_long()
[L179]       CALL        assume_abort_if_not(var_1_31 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L179]       RET         assume_abort_if_not(var_1_31 >= 0)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L180]       CALL        assume_abort_if_not(var_1_31 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L180]       RET         assume_abort_if_not(var_1_31 <= 1)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L181]                   var_1_34 = __VERIFIER_nondet_uchar()
[L182]       CALL        assume_abort_if_not(var_1_34 >= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L182]       RET         assume_abort_if_not(var_1_34 >= 127)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L183]       CALL        assume_abort_if_not(var_1_34 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L183]       RET         assume_abort_if_not(var_1_34 <= 254)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L184]                   var_1_36 = __VERIFIER_nondet_uchar()
[L185]       CALL        assume_abort_if_not(var_1_36 >= 190)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L185]       RET         assume_abort_if_not(var_1_36 >= 190)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L186]       CALL        assume_abort_if_not(var_1_36 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L186]       RET         assume_abort_if_not(var_1_36 <= 254)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L187]                   var_1_37 = __VERIFIER_nondet_uchar()
[L188]       CALL        assume_abort_if_not(var_1_37 >= 31)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L188]       RET         assume_abort_if_not(var_1_37 >= 31)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L189]       CALL        assume_abort_if_not(var_1_37 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L189]       RET         assume_abort_if_not(var_1_37 <= 63)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L212]       RET         updateVariables()
[L213]       CALL        step()
[L65]                    signed long int stepLocal_4 = last_1_var_1_9;
[L66]                    signed long int stepLocal_3 = var_1_24 % var_1_34;
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=63, stepLocal_4=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L67]        COND FALSE  !(last_1_var_1_16 <= stepLocal_4)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=63, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L70]        COND TRUE   stepLocal_3 >= last_1_var_1_27
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L71]        COND FALSE  !(\read(var_1_7))
[L74]                    var_1_33 = var_1_28
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L78]                    signed long int stepLocal_0 = 50 * last_1_var_1_29;
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L79]        EXPR        last_1_var_1_16 | last_1_var_1_9
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L79]        COND FALSE  !((last_1_var_1_16 | last_1_var_1_9) >= stepLocal_0)
[L82]        COND FALSE  !((last_1_var_1_19 + last_1_var_1_19) > 200.875f)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=50, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L89]                    var_1_19 = var_1_20
[L90]                    var_1_21 = ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))
[L91]                    var_1_27 = ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)
[L92]                    var_1_38 = var_1_20
[L93]                    var_1_39 = 128
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L94]        COND FALSE  !(\read(var_1_7))
[L101]                   var_1_16 = var_1_9
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L103]                   unsigned char stepLocal_2 = var_1_7;
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=8, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L104]       COND FALSE  !(var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19))))
[L109]                   var_1_25 = 2u
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L111]                   signed long int stepLocal_5 = var_1_30 + var_1_39;
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, stepLocal_5=128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L112]       COND TRUE   (var_1_25 - last_1_var_1_35) <= stepLocal_5
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L113]       COND FALSE  !(\read(var_1_7))
[L116]                   var_1_35 = ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24))))
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L119]                   unsigned short int stepLocal_1 = var_1_1;
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_1=32, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L120]       COND TRUE   stepLocal_1 <= var_1_35
[L121]                   var_1_18 = (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L125]       EXPR        var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L125]       COND FALSE  !((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18)
[L130]                   var_1_29 = (var_1_28 - var_1_30)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128]
[L132]       COND TRUE   var_1_21 > var_1_29
[L133]                   var_1_6 = (var_1_21 - last_1_var_1_6)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128]
[L213]       RET         step()
[L214]       CALL, EXPR  property()
[L204]       EXPR        last_1_var_1_16 | last_1_var_1_9
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128]
[L204]       EXPR        (((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30))))
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128]
[L204-L205]              return (((((((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30))))) && ((last_1_var_1_16 <= last_1_var_1_9) ? (var_1_33 == ((unsigned char) (var_1_34 - var_1_28))) : (((var_1_24 % var_1_34) >= last_1_var_1_27) ? (var_1_7 ? (var_1_33 == ((unsigned char) (((((((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) > ((64 - var_1_30))) ? (((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) : ((64 - var_1_30)))) + 1))) : (var_1_33 == ((unsigned char) var_1_28))) : 1))) && (((var_1_25 - last_1_var_1_35) <= (var_1_30 + var_1_39)) ? (var_1_7 ? (var_1_35 == ((unsigned char) var_1_28)) : (var_1_35 == ((unsigned char) ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24))))))) : 1)) && (var_1_38 == ((double) var_1_20))) && (var_1_39 == ((signed short int) 128))
;
[L214]       RET, EXPR   property()
[L214]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=1, var_1_24=63, var_1_25=2, var_1_27=174, var_1_28=-195, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=-195, var_1_34=-372, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=1, var_1_9=-128]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 14, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2994 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2961 mSDsluCounter, 9481 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7466 mSDsCounter, 1187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6922 IncrementalHoareTripleChecker+Invalid, 8109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1187 mSolverCounterUnsat, 2015 mSDtfsCounter, 6922 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1343 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6390 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2995occurred in iteration=13, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2754 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 3886 NumberOfCodeBlocks, 3886 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3455 ConstructedInterpolants, 1 QuantifiedInterpolants, 19920 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2033 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 31236/31620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-03 23:53:16,999 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.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 f0881add29b2e913dccd0b5d11f581533e2263693d3a446dde3d837a9a510a5a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 23:53:18,718 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 23:53:18,788 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-03 23:53:18,795 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 23:53:18,795 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 23:53:18,820 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 23:53:18,822 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 23:53:18,822 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 23:53:18,823 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 23:53:18,823 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 23:53:18,823 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 23:53:18,823 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 23:53:18,824 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 23:53:18,824 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 23:53:18,824 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 23:53:18,824 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 23:53:18,825 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 23:53:18,825 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 23:53:18,825 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 -> f0881add29b2e913dccd0b5d11f581533e2263693d3a446dde3d837a9a510a5a
[2025-03-03 23:53:19,075 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 23:53:19,082 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 23:53:19,084 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 23:53:19,084 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 23:53:19,084 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 23:53:19,085 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i
[2025-03-03 23:53:20,268 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc9771be/e66a32b3f82441acb8ec084191e07159/FLAG80679a782
[2025-03-03 23:53:20,462 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 23:53:20,462 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i
[2025-03-03 23:53:20,473 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc9771be/e66a32b3f82441acb8ec084191e07159/FLAG80679a782
[2025-03-03 23:53:20,490 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc9771be/e66a32b3f82441acb8ec084191e07159
[2025-03-03 23:53:20,492 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 23:53:20,494 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 23:53:20,496 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 23:53:20,497 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 23:53:20,500 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 23:53:20,501 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,502 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e51a49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20, skipping insertion in model container
[2025-03-03 23:53:20,502 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,525 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 23:53:20,639 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_operatoramount_amount100_file-22.i[916,929]
[2025-03-03 23:53:20,723 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 23:53:20,737 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 23:53:20,746 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_operatoramount_amount100_file-22.i[916,929]
[2025-03-03 23:53:20,789 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 23:53:20,809 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 23:53:20,810 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20 WrapperNode
[2025-03-03 23:53:20,810 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 23:53:20,811 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 23:53:20,811 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 23:53:20,812 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 23:53:20,816 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,824 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,854 INFO  L138                Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208
[2025-03-03 23:53:20,854 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 23:53:20,854 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 23:53:20,855 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 23:53:20,855 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 23:53:20,861 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,862 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,866 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,878 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 23:53:20,878 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,878 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,886 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,887 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,889 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,890 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,893 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 23:53:20,894 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 23:53:20,894 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 23:53:20,894 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 23:53:20,899 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (1/1) ...
[2025-03-03 23:53:20,907 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 23:53:20,918 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 23:53:20,932 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 23:53:20,935 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 23:53:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 23:53:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-03 23:53:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 23:53:20,956 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 23:53:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 23:53:20,956 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 23:53:21,047 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 23:53:21,049 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 23:53:21,938 INFO  L?                        ?]: Removed 20 outVars from TransFormulas that were not future-live.
[2025-03-03 23:53:21,939 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 23:53:21,946 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 23:53:21,946 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 23:53:21,947 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:53:21 BoogieIcfgContainer
[2025-03-03 23:53:21,947 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 23:53:21,949 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 23:53:21,949 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 23:53:21,953 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 23:53:21,953 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:53:20" (1/3) ...
[2025-03-03 23:53:21,954 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9642fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:53:21, skipping insertion in model container
[2025-03-03 23:53:21,954 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:53:20" (2/3) ...
[2025-03-03 23:53:21,954 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9642fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:53:21, skipping insertion in model container
[2025-03-03 23:53:21,954 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:53:21" (3/3) ...
[2025-03-03 23:53:21,956 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-22.i
[2025-03-03 23:53:21,965 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 23:53:21,967 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-22.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 23:53:22,018 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 23:53:22,026 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;@2d9ca7d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 23:53:22,026 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 23:53:22,029 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 87 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2025-03-03 23:53:22,038 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-03 23:53:22,038 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:22,038 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:22,039 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:22,042 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:22,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -437817475, now seen corresponding path program 1 times
[2025-03-03 23:53:22,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:53:22,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680911730]
[2025-03-03 23:53:22,050 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:22,050 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:22,050 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:53:22,053 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 23:53:22,053 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2025-03-03 23:53:22,149 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 23:53:22,274 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 23:53:22,275 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:22,275 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:22,282 INFO  L256         TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:22,288 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:22,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked.
[2025-03-03 23:53:22,332 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:53:22,332 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:53:22,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680911730]
[2025-03-03 23:53:22,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680911730] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:53:22,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:53:22,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 23:53:22,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806005548]
[2025-03-03 23:53:22,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:53:22,337 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 23:53:22,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:53:22,351 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 23:53:22,351 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 23:53:22,353 INFO  L87              Difference]: Start difference. First operand  has 87 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand  has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)
[2025-03-03 23:53:22,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:22,376 INFO  L93              Difference]: Finished difference Result 168 states and 298 transitions.
[2025-03-03 23:53:22,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 23:53:22,382 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 194
[2025-03-03 23:53:22,382 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:22,388 INFO  L225             Difference]: With dead ends: 168
[2025-03-03 23:53:22,388 INFO  L226             Difference]: Without dead ends: 84
[2025-03-03 23:53:22,395 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 23:53:22,397 INFO  L435           NwaCegarLoop]: 131 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, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:22,399 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 23:53:22,411 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-03-03 23:53:22,429 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-03-03 23:53:22,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2025-03-03 23:53:22,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions.
[2025-03-03 23:53:22,435 INFO  L78                 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 194
[2025-03-03 23:53:22,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:22,436 INFO  L471      AbstractCegarLoop]: Abstraction has 84 states and 131 transitions.
[2025-03-03 23:53:22,436 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)
[2025-03-03 23:53:22,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions.
[2025-03-03 23:53:22,440 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-03 23:53:22,440 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:22,441 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:22,448 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2025-03-03 23:53:22,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:22,642 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:22,643 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:22,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 362561502, now seen corresponding path program 1 times
[2025-03-03 23:53:22,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:53:22,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380042264]
[2025-03-03 23:53:22,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:22,644 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:22,644 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:53:22,651 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 23:53:22,652 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2025-03-03 23:53:22,719 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 23:53:22,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 23:53:22,838 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:22,838 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:22,844 INFO  L256         TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:22,850 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:23,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:53:23,402 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:53:23,402 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:53:23,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380042264]
[2025-03-03 23:53:23,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [380042264] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:53:23,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:53:23,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 23:53:23,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823370300]
[2025-03-03 23:53:23,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:53:23,406 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 23:53:23,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:53:23,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 23:53:23,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:53:23,407 INFO  L87              Difference]: Start difference. First operand 84 states and 131 transitions. Second operand  has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:24,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:24,379 INFO  L93              Difference]: Finished difference Result 268 states and 420 transitions.
[2025-03-03 23:53:24,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 23:53:24,395 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194
[2025-03-03 23:53:24,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:24,398 INFO  L225             Difference]: With dead ends: 268
[2025-03-03 23:53:24,398 INFO  L226             Difference]: Without dead ends: 187
[2025-03-03 23:53:24,399 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 23:53:24,399 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 142 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:24,399 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 493 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 23:53:24,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 187 states.
[2025-03-03 23:53:24,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162.
[2025-03-03 23:53:24,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 162 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62)
[2025-03-03 23:53:24,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 255 transitions.
[2025-03-03 23:53:24,439 INFO  L78                 Accepts]: Start accepts. Automaton has 162 states and 255 transitions. Word has length 194
[2025-03-03 23:53:24,439 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:24,439 INFO  L471      AbstractCegarLoop]: Abstraction has 162 states and 255 transitions.
[2025-03-03 23:53:24,440 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:24,440 INFO  L276                IsEmpty]: Start isEmpty. Operand 162 states and 255 transitions.
[2025-03-03 23:53:24,443 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-03 23:53:24,444 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:24,444 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:24,452 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2025-03-03 23:53:24,648 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:24,648 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:24,649 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:24,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 1241019628, now seen corresponding path program 1 times
[2025-03-03 23:53:24,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:53:24,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090760220]
[2025-03-03 23:53:24,650 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:24,650 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:24,650 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:53:24,653 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 23:53:24,654 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2025-03-03 23:53:24,702 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 23:53:24,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 23:53:24,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:24,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:24,824 INFO  L256         TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:24,828 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:26,197 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:53:26,197 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:53:26,197 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:53:26,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090760220]
[2025-03-03 23:53:26,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090760220] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:53:26,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:53:26,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 23:53:26,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89873900]
[2025-03-03 23:53:26,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:53:26,198 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 23:53:26,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:53:26,201 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 23:53:26,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:53:26,202 INFO  L87              Difference]: Start difference. First operand 162 states and 255 transitions. Second operand  has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:28,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:28,166 INFO  L93              Difference]: Finished difference Result 431 states and 677 transitions.
[2025-03-03 23:53:28,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 23:53:28,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195
[2025-03-03 23:53:28,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:28,183 INFO  L225             Difference]: With dead ends: 431
[2025-03-03 23:53:28,183 INFO  L226             Difference]: Without dead ends: 272
[2025-03-03 23:53:28,184 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 23:53:28,184 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:28,184 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 441 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 23:53:28,185 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 272 states.
[2025-03-03 23:53:28,238 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 240.
[2025-03-03 23:53:28,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 240 states, 143 states have (on average 1.3426573426573427) internal successors, (192), 143 states have internal predecessors, (192), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93)
[2025-03-03 23:53:28,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 378 transitions.
[2025-03-03 23:53:28,241 INFO  L78                 Accepts]: Start accepts. Automaton has 240 states and 378 transitions. Word has length 195
[2025-03-03 23:53:28,242 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:28,242 INFO  L471      AbstractCegarLoop]: Abstraction has 240 states and 378 transitions.
[2025-03-03 23:53:28,242 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:28,242 INFO  L276                IsEmpty]: Start isEmpty. Operand 240 states and 378 transitions.
[2025-03-03 23:53:28,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-03 23:53:28,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:28,244 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:28,252 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2025-03-03 23:53:28,445 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:28,445 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:28,446 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:28,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 730485451, now seen corresponding path program 1 times
[2025-03-03 23:53:28,447 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:53:28,447 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710566040]
[2025-03-03 23:53:28,447 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:28,447 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:28,447 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:53:28,449 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 23:53:28,451 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2025-03-03 23:53:28,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 23:53:28,592 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 23:53:28,593 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:28,593 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:28,598 INFO  L256         TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:28,602 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:29,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:53:29,520 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:53:29,520 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:53:29,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710566040]
[2025-03-03 23:53:29,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [710566040] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:53:29,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:53:29,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 23:53:29,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562785070]
[2025-03-03 23:53:29,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:53:29,521 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 23:53:29,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:53:29,521 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 23:53:29,521 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 23:53:29,521 INFO  L87              Difference]: Start difference. First operand 240 states and 378 transitions. Second operand  has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:31,055 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:31,055 INFO  L93              Difference]: Finished difference Result 403 states and 633 transitions.
[2025-03-03 23:53:31,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 23:53:31,069 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195
[2025-03-03 23:53:31,069 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:31,071 INFO  L225             Difference]: With dead ends: 403
[2025-03-03 23:53:31,071 INFO  L226             Difference]: Without dead ends: 166
[2025-03-03 23:53:31,072 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:53:31,072 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 71 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:31,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 364 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-03 23:53:31,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 166 states.
[2025-03-03 23:53:31,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143.
[2025-03-03 23:53:31,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 143 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62)
[2025-03-03 23:53:31,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 222 transitions.
[2025-03-03 23:53:31,087 INFO  L78                 Accepts]: Start accepts. Automaton has 143 states and 222 transitions. Word has length 195
[2025-03-03 23:53:31,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:31,088 INFO  L471      AbstractCegarLoop]: Abstraction has 143 states and 222 transitions.
[2025-03-03 23:53:31,088 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:31,088 INFO  L276                IsEmpty]: Start isEmpty. Operand 143 states and 222 transitions.
[2025-03-03 23:53:31,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-03 23:53:31,090 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:31,090 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:31,097 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2025-03-03 23:53:31,290 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:31,291 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:31,291 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:31,291 INFO  L85        PathProgramCache]: Analyzing trace with hash -1533692484, now seen corresponding path program 1 times
[2025-03-03 23:53:31,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:53:31,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218719601]
[2025-03-03 23:53:31,292 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:31,292 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:31,292 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:53:31,294 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 23:53:31,295 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2025-03-03 23:53:31,327 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-03 23:53:31,434 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-03 23:53:31,434 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:31,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:31,441 INFO  L256         TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:31,444 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:31,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:53:31,783 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:53:31,783 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:53:31,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218719601]
[2025-03-03 23:53:31,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218719601] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:53:31,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:53:31,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 23:53:31,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673337870]
[2025-03-03 23:53:31,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:53:31,784 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 23:53:31,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:53:31,785 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 23:53:31,785 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 23:53:31,785 INFO  L87              Difference]: Start difference. First operand 143 states and 222 transitions. Second operand  has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:33,068 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:33,069 INFO  L93              Difference]: Finished difference Result 334 states and 519 transitions.
[2025-03-03 23:53:33,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 23:53:33,084 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196
[2025-03-03 23:53:33,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:33,087 INFO  L225             Difference]: With dead ends: 334
[2025-03-03 23:53:33,087 INFO  L226             Difference]: Without dead ends: 253
[2025-03-03 23:53:33,088 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 23:53:33,088 INFO  L435           NwaCegarLoop]: 140 mSDtfsCounter, 140 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:33,089 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 441 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 23:53:33,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 253 states.
[2025-03-03 23:53:33,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 223.
[2025-03-03 23:53:33,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 223 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 126 states have internal predecessors, (163), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93)
[2025-03-03 23:53:33,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 349 transitions.
[2025-03-03 23:53:33,123 INFO  L78                 Accepts]: Start accepts. Automaton has 223 states and 349 transitions. Word has length 196
[2025-03-03 23:53:33,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:33,124 INFO  L471      AbstractCegarLoop]: Abstraction has 223 states and 349 transitions.
[2025-03-03 23:53:33,124 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:33,124 INFO  L276                IsEmpty]: Start isEmpty. Operand 223 states and 349 transitions.
[2025-03-03 23:53:33,125 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-03 23:53:33,125 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:33,125 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:33,134 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 (6)] Ended with exit code 0
[2025-03-03 23:53:33,326 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:33,326 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:33,327 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:33,327 INFO  L85        PathProgramCache]: Analyzing trace with hash -772347002, now seen corresponding path program 1 times
[2025-03-03 23:53:33,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:53:33,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418204172]
[2025-03-03 23:53:33,327 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:33,327 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:33,327 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:53:33,329 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 23:53:33,332 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 (7)] Waiting until timeout for monitored process
[2025-03-03 23:53:33,368 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-03 23:53:33,474 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-03 23:53:33,474 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:33,474 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:33,480 INFO  L256         TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:33,483 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:33,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-03-03 23:53:33,500 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 23:53:33,500 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:53:33,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418204172]
[2025-03-03 23:53:33,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418204172] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 23:53:33,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 23:53:33,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 23:53:33,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755855756]
[2025-03-03 23:53:33,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 23:53:33,501 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 23:53:33,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:53:33,501 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 23:53:33,502 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 23:53:33,502 INFO  L87              Difference]: Start difference. First operand 223 states and 349 transitions. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:34,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 23:53:34,363 INFO  L93              Difference]: Finished difference Result 438 states and 684 transitions.
[2025-03-03 23:53:34,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 23:53:34,363 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197
[2025-03-03 23:53:34,364 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 23:53:34,366 INFO  L225             Difference]: With dead ends: 438
[2025-03-03 23:53:34,366 INFO  L226             Difference]: Without dead ends: 277
[2025-03-03 23:53:34,366 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 23:53:34,367 INFO  L435           NwaCegarLoop]: 137 mSDtfsCounter, 30 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 23:53:34,367 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 254 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 23:53:34,368 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 277 states.
[2025-03-03 23:53:34,382 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263.
[2025-03-03 23:53:34,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 263 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93)
[2025-03-03 23:53:34,384 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 409 transitions.
[2025-03-03 23:53:34,384 INFO  L78                 Accepts]: Start accepts. Automaton has 263 states and 409 transitions. Word has length 197
[2025-03-03 23:53:34,385 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 23:53:34,385 INFO  L471      AbstractCegarLoop]: Abstraction has 263 states and 409 transitions.
[2025-03-03 23:53:34,385 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-03-03 23:53:34,385 INFO  L276                IsEmpty]: Start isEmpty. Operand 263 states and 409 transitions.
[2025-03-03 23:53:34,386 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-03 23:53:34,386 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 23:53:34,386 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 23:53:34,393 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2025-03-03 23:53:34,587 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:34,587 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 23:53:34,587 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 23:53:34,587 INFO  L85        PathProgramCache]: Analyzing trace with hash 1715165831, now seen corresponding path program 1 times
[2025-03-03 23:53:34,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 23:53:34,588 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945144622]
[2025-03-03 23:53:34,588 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 23:53:34,588 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-03 23:53:34,588 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 23:53:34,590 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-03 23:53:34,591 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 (8)] Waiting until timeout for monitored process
[2025-03-03 23:53:34,634 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-03 23:53:34,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-03 23:53:34,743 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 23:53:34,744 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 23:53:34,751 INFO  L256         TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-03 23:53:34,754 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 23:53:39,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 918 proven. 54 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked.
[2025-03-03 23:53:39,151 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 23:53:48,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked.
[2025-03-03 23:53:48,648 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 23:53:48,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945144622]
[2025-03-03 23:53:48,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [945144622] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 23:53:48,648 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 23:53:48,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2025-03-03 23:53:48,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582882788]
[2025-03-03 23:53:48,648 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 23:53:48,648 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 23:53:48,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 23:53:48,649 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 23:53:48,649 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-03-03 23:53:48,649 INFO  L87              Difference]: Start difference. First operand 263 states and 409 transitions. Second operand  has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 3 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50)