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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 19:09:36,384 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 19:09:36,428 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 19:09:36,431 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 19:09:36,431 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 19:09:36,456 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 19:09:36,457 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 19:09:36,457 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 19:09:36,457 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 19:09:36,457 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 19:09:36,457 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 19:09:36,457 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 19:09:36,458 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 19:09:36,458 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 19:09:36,459 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 19:09:36,459 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 19:09:36,459 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 19:09:36,459 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 19:09:36,459 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 19:09:36,460 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 19:09:36,460 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 19:09:36,461 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 19:09:36,461 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 19:09:36,461 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:09:36,461 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 19:09:36,461 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 19:09:36,461 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 19:09:36,461 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 19:09:36,461 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 19:09:36,461 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 19:09:36,462 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 19:09:36,462 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 19:09:36,462 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 19:09:36,462 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 19:09:36,462 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 -> 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f
[2025-03-03 19:09:36,679 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 19:09:36,687 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 19:09:36,689 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 19:09:36,689 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 19:09:36,690 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 19:09:36,690 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i
[2025-03-03 19:09:37,841 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/605ec63b4/4a914dd1394b4d189fe8bc281a6f5f71/FLAGb995a1b59
[2025-03-03 19:09:38,089 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 19:09:38,089 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i
[2025-03-03 19:09:38,098 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/605ec63b4/4a914dd1394b4d189fe8bc281a6f5f71/FLAGb995a1b59
[2025-03-03 19:09:38,399 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/605ec63b4/4a914dd1394b4d189fe8bc281a6f5f71
[2025-03-03 19:09:38,401 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 19:09:38,402 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 19:09:38,404 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 19:09:38,404 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 19:09:38,407 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 19:09:38,408 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,409 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38, skipping insertion in model container
[2025-03-03 19:09:38,410 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,424 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 19:09:38,506 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i[913,926]
[2025-03-03 19:09:38,543 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:09:38,551 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 19:09:38,558 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i[913,926]
[2025-03-03 19:09:38,577 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:09:38,587 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 19:09:38,588 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38 WrapperNode
[2025-03-03 19:09:38,588 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 19:09:38,589 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 19:09:38,589 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 19:09:38,589 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 19:09:38,592 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,598 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,616 INFO  L138                Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154
[2025-03-03 19:09:38,617 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 19:09:38,617 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 19:09:38,617 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 19:09:38,617 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 19:09:38,628 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,628 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,630 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,644 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 19:09:38,644 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,644 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,649 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,650 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,652 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,652 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,654 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 19:09:38,655 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 19:09:38,655 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 19:09:38,655 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 19:09:38,655 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (1/1) ...
[2025-03-03 19:09:38,659 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:09:38,669 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:09:38,681 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 19:09:38,686 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 19:09:38,699 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 19:09:38,699 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 19:09:38,699 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 19:09:38,699 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 19:09:38,699 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 19:09:38,699 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 19:09:38,760 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 19:09:38,761 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 19:09:38,964 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~bitwise17#1;
[2025-03-03 19:09:38,992 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2025-03-03 19:09:38,992 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 19:09:39,004 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 19:09:39,004 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 19:09:39,005 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:09:39 BoogieIcfgContainer
[2025-03-03 19:09:39,005 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 19:09:39,007 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 19:09:39,007 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 19:09:39,010 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 19:09:39,011 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:09:38" (1/3) ...
[2025-03-03 19:09:39,011 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3352816a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:09:39, skipping insertion in model container
[2025-03-03 19:09:39,011 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:38" (2/3) ...
[2025-03-03 19:09:39,011 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3352816a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:09:39, skipping insertion in model container
[2025-03-03 19:09:39,011 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:09:39" (3/3) ...
[2025-03-03 19:09:39,012 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-13.i
[2025-03-03 19:09:39,021 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 19:09:39,022 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-13.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 19:09:39,052 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 19:09:39,059 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;@69edb991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 19:09:39,059 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 19:09:39,062 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 68 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-03 19:09:39,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-03 19:09:39,070 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:39,071 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:39,071 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:39,074 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:39,074 INFO  L85        PathProgramCache]: Analyzing trace with hash -2142345336, now seen corresponding path program 1 times
[2025-03-03 19:09:39,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:09:39,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619906080]
[2025-03-03 19:09:39,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:39,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:09:39,144 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-03 19:09:39,166 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-03 19:09:39,166 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:39,166 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:39,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked.
[2025-03-03 19:09:39,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:09:39,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619906080]
[2025-03-03 19:09:39,301 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619906080] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 19:09:39,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601722686]
[2025-03-03 19:09:39,301 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:39,301 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 19:09:39,301 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:09:39,304 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 19:09:39,305 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 19:09:39,371 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-03 19:09:39,430 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-03 19:09:39,430 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:39,430 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:39,433 INFO  L256         TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 19:09:39,437 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:09:39,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked.
[2025-03-03 19:09:39,462 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:09:39,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [601722686] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:09:39,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 19:09:39,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 19:09:39,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004065338]
[2025-03-03 19:09:39,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:09:39,468 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 19:09:39,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:09:39,482 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 19:09:39,482 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 19:09:39,483 INFO  L87              Difference]: Start difference. First operand  has 68 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand  has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-03 19:09:39,505 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:09:39,506 INFO  L93              Difference]: Finished difference Result 130 states and 217 transitions.
[2025-03-03 19:09:39,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 19:09:39,508 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 134
[2025-03-03 19:09:39,508 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:09:39,512 INFO  L225             Difference]: With dead ends: 130
[2025-03-03 19:09:39,512 INFO  L226             Difference]: Without dead ends: 65
[2025-03-03 19:09:39,515 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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 19:09:39,517 INFO  L435           NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:09:39,518 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:09:39,527 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2025-03-03 19:09:39,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2025-03-03 19:09:39,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 65 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-03 19:09:39,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions.
[2025-03-03 19:09:39,553 INFO  L78                 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 134
[2025-03-03 19:09:39,553 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:09:39,554 INFO  L471      AbstractCegarLoop]: Abstraction has 65 states and 95 transitions.
[2025-03-03 19:09:39,554 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-03 19:09:39,554 INFO  L276                IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions.
[2025-03-03 19:09:39,576 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-03 19:09:39,578 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:39,578 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:39,585 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 19:09:39,782 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 19:09:39,782 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:39,783 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:39,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -480472820, now seen corresponding path program 1 times
[2025-03-03 19:09:39,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:09:39,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122960548]
[2025-03-03 19:09:39,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:39,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:09:39,808 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-03 19:09:39,865 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-03 19:09:39,865 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:39,865 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:39,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-03 19:09:39,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:09:39,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122960548]
[2025-03-03 19:09:39,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122960548] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:09:39,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:09:39,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:09:39,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659217844]
[2025-03-03 19:09:39,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:09:39,984 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:09:39,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:09:39,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:09:39,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:09:39,985 INFO  L87              Difference]: Start difference. First operand 65 states and 95 transitions. Second operand  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:40,030 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:09:40,031 INFO  L93              Difference]: Finished difference Result 161 states and 233 transitions.
[2025-03-03 19:09:40,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:09:40,032 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134
[2025-03-03 19:09:40,032 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:09:40,033 INFO  L225             Difference]: With dead ends: 161
[2025-03-03 19:09:40,033 INFO  L226             Difference]: Without dead ends: 99
[2025-03-03 19:09:40,034 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 19:09:40,034 INFO  L435           NwaCegarLoop]: 123 mSDtfsCounter, 39 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:09:40,034 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 208 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:09:40,035 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2025-03-03 19:09:40,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96.
[2025-03-03 19:09:40,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2025-03-03 19:09:40,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions.
[2025-03-03 19:09:40,048 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 134
[2025-03-03 19:09:40,049 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:09:40,049 INFO  L471      AbstractCegarLoop]: Abstraction has 96 states and 138 transitions.
[2025-03-03 19:09:40,049 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:40,049 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions.
[2025-03-03 19:09:40,050 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-03 19:09:40,050 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:40,050 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:40,050 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 19:09:40,051 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:40,051 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:40,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 1027078989, now seen corresponding path program 1 times
[2025-03-03 19:09:40,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:09:40,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424449470]
[2025-03-03 19:09:40,051 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:40,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:09:40,062 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-03 19:09:40,102 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-03 19:09:40,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:40,103 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:40,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-03 19:09:40,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:09:40,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424449470]
[2025-03-03 19:09:40,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424449470] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:09:40,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:09:40,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:09:40,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623067568]
[2025-03-03 19:09:40,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:09:40,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:09:40,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:09:40,507 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:09:40,508 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:09:40,508 INFO  L87              Difference]: Start difference. First operand 96 states and 138 transitions. Second operand  has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:40,788 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:09:40,789 INFO  L93              Difference]: Finished difference Result 271 states and 393 transitions.
[2025-03-03 19:09:40,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 19:09:40,789 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134
[2025-03-03 19:09:40,790 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:09:40,792 INFO  L225             Difference]: With dead ends: 271
[2025-03-03 19:09:40,793 INFO  L226             Difference]: Without dead ends: 178
[2025-03-03 19:09:40,793 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-03 19:09:40,794 INFO  L435           NwaCegarLoop]: 83 mSDtfsCounter, 75 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 19:09:40,794 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 329 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 19:09:40,795 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 178 states.
[2025-03-03 19:09:40,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136.
[2025-03-03 19:09:40,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 87 states have internal predecessors, (106), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-03 19:09:40,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 198 transitions.
[2025-03-03 19:09:40,815 INFO  L78                 Accepts]: Start accepts. Automaton has 136 states and 198 transitions. Word has length 134
[2025-03-03 19:09:40,815 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:09:40,815 INFO  L471      AbstractCegarLoop]: Abstraction has 136 states and 198 transitions.
[2025-03-03 19:09:40,816 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:40,816 INFO  L276                IsEmpty]: Start isEmpty. Operand 136 states and 198 transitions.
[2025-03-03 19:09:40,817 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-03 19:09:40,817 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:40,817 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:40,817 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 19:09:40,817 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:40,818 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:40,818 INFO  L85        PathProgramCache]: Analyzing trace with hash -78449607, now seen corresponding path program 1 times
[2025-03-03 19:09:40,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:09:40,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195402599]
[2025-03-03 19:09:40,818 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:40,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:09:40,830 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-03 19:09:40,854 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-03 19:09:40,857 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:40,857 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:41,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-03 19:09:41,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:09:41,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195402599]
[2025-03-03 19:09:41,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195402599] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:09:41,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:09:41,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:09:41,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441890286]
[2025-03-03 19:09:41,057 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:09:41,057 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:09:41,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:09:41,058 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:09:41,058 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:09:41,058 INFO  L87              Difference]: Start difference. First operand 136 states and 198 transitions. Second operand  has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:41,239 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:09:41,240 INFO  L93              Difference]: Finished difference Result 311 states and 448 transitions.
[2025-03-03 19:09:41,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 19:09:41,240 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135
[2025-03-03 19:09:41,241 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:09:41,243 INFO  L225             Difference]: With dead ends: 311
[2025-03-03 19:09:41,243 INFO  L226             Difference]: Without dead ends: 218
[2025-03-03 19:09:41,243 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-03 19:09:41,244 INFO  L435           NwaCegarLoop]: 81 mSDtfsCounter, 132 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 19:09:41,244 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 282 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 19:09:41,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2025-03-03 19:09:41,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 142.
[2025-03-03 19:09:41,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 142 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 93 states have internal predecessors, (114), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-03 19:09:41,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 206 transitions.
[2025-03-03 19:09:41,276 INFO  L78                 Accepts]: Start accepts. Automaton has 142 states and 206 transitions. Word has length 135
[2025-03-03 19:09:41,277 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:09:41,277 INFO  L471      AbstractCegarLoop]: Abstraction has 142 states and 206 transitions.
[2025-03-03 19:09:41,277 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:41,277 INFO  L276                IsEmpty]: Start isEmpty. Operand 142 states and 206 transitions.
[2025-03-03 19:09:41,278 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-03 19:09:41,278 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:41,278 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:41,278 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 19:09:41,278 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:41,278 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:41,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -371852614, now seen corresponding path program 1 times
[2025-03-03 19:09:41,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:09:41,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065620498]
[2025-03-03 19:09:41,279 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:41,279 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:09:41,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-03 19:09:41,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-03 19:09:41,422 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:41,422 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-03 19:09:41,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639635936]
[2025-03-03 19:09:41,424 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:41,424 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 19:09:41,425 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:09:41,426 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 19:09:41,428 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 19:09:41,473 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-03 19:09:41,507 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-03 19:09:41,507 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:41,507 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 19:09:41,507 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-03 19:09:41,524 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-03 19:09:41,542 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-03 19:09:41,542 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:41,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 19:09:41,613 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-03 19:09:41,613 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-03 19:09:41,614 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 19:09:41,622 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 19:09:41,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 19:09:41,819 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2025-03-03 19:09:41,899 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 19:09:41,902 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:09:41 BoogieIcfgContainer
[2025-03-03 19:09:41,902 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 19:09:41,902 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 19:09:41,902 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 19:09:41,903 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 19:09:41,903 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:09:39" (3/4) ...
[2025-03-03 19:09:41,904 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-03 19:09:41,905 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 19:09:41,906 INFO  L158              Benchmark]: Toolchain (without parser) took 3503.53ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 98.4MB in the end (delta: 24.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB.
[2025-03-03 19:09:41,906 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 19:09:41,906 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 184.34ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 108.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 19:09:41,906 INFO  L158              Benchmark]: Boogie Procedure Inliner took 28.16ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 19:09:41,906 INFO  L158              Benchmark]: Boogie Preprocessor took 36.81ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 100.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 19:09:41,906 INFO  L158              Benchmark]: IcfgBuilder took 350.28ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 78.8MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-03 19:09:41,907 INFO  L158              Benchmark]: TraceAbstraction took 2895.05ms. Allocated memory is still 167.8MB. Free memory was 78.3MB in the beginning and 98.4MB in the end (delta: -20.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 19:09:41,907 INFO  L158              Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 167.8MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 19:09:41,908 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.18ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 184.34ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 108.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 28.16ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 36.81ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 100.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 350.28ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 78.8MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 2895.05ms. Allocated memory is still 167.8MB. Free memory was 78.3MB in the beginning and 98.4MB in the end (delta: -20.1MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 2.69ms. Allocated memory is still 167.8MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 116. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    unsigned short int var_1_1 = 32;
[L23]                    signed char var_1_4 = 16;
[L24]                    unsigned char var_1_5 = 1;
[L25]                    unsigned char var_1_6 = 1;
[L26]                    unsigned char var_1_8 = 1;
[L27]                    unsigned char var_1_9 = 0;
[L28]                    unsigned char var_1_10 = 128;
[L29]                    unsigned char var_1_11 = 64;
[L30]                    signed char var_1_12 = -10;
[L31]                    signed char var_1_13 = -10;
[L32]                    signed char var_1_14 = -25;
[L33]                    double var_1_15 = 64.875;
[L34]                    double var_1_17 = 1.625;
[L35]                    double var_1_18 = 32.2;
[L36]                    double var_1_19 = 8.6;
[L37]                    double var_1_20 = 10.5;
[L38]                    signed short int var_1_21 = -64;
[L39]                    unsigned char var_1_22 = 25;
[L40]                    unsigned char var_1_23 = 0;
[L41]                    unsigned long int var_1_24 = 5;
[L42]                    signed short int last_1_var_1_21 = -64;
[L43]                    unsigned char last_1_var_1_22 = 25;
             VAL         [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L131]                   isInitial = 1
[L132]       FCALL       initially()
[L133]       COND TRUE   1
[L134]       CALL        updateLastVariables()
[L123]                   last_1_var_1_21 = var_1_21
[L124]                   last_1_var_1_22 = var_1_22
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L134]       RET         updateLastVariables()
[L135]       CALL        updateVariables()
[L89]                    var_1_4 = __VERIFIER_nondet_char()
[L90]        CALL        assume_abort_if_not(var_1_4 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L90]        RET         assume_abort_if_not(var_1_4 >= 0)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L91]        CALL        assume_abort_if_not(var_1_4 <= 32)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L91]        RET         assume_abort_if_not(var_1_4 <= 32)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L92]                    var_1_5 = __VERIFIER_nondet_uchar()
[L93]        CALL        assume_abort_if_not(var_1_5 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0]
[L93]        RET         assume_abort_if_not(var_1_5 >= 0)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0]
[L94]        CALL        assume_abort_if_not(var_1_5 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L94]        RET         assume_abort_if_not(var_1_5 <= 1)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0]
[L95]                    var_1_6 = __VERIFIER_nondet_uchar()
[L96]        CALL        assume_abort_if_not(var_1_6 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0]
[L96]        RET         assume_abort_if_not(var_1_6 >= 0)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0]
[L97]        CALL        assume_abort_if_not(var_1_6 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L97]        RET         assume_abort_if_not(var_1_6 <= 1)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L98]                    var_1_9 = __VERIFIER_nondet_uchar()
[L99]        CALL        assume_abort_if_not(var_1_9 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1]
[L99]        RET         assume_abort_if_not(var_1_9 >= 0)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1]
[L100]       CALL        assume_abort_if_not(var_1_9 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L100]       RET         assume_abort_if_not(var_1_9 <= 1)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L101]                   var_1_10 = __VERIFIER_nondet_uchar()
[L102]       CALL        assume_abort_if_not(var_1_10 >= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L102]       RET         assume_abort_if_not(var_1_10 >= 127)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L103]       CALL        assume_abort_if_not(var_1_10 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L103]       RET         assume_abort_if_not(var_1_10 <= 254)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L104]                   var_1_11 = __VERIFIER_nondet_uchar()
[L105]       CALL        assume_abort_if_not(var_1_11 >= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L105]       RET         assume_abort_if_not(var_1_11 >= 63)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L106]       CALL        assume_abort_if_not(var_1_11 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L106]       RET         assume_abort_if_not(var_1_11 <= 127)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L107]                   var_1_13 = __VERIFIER_nondet_char()
[L108]       CALL        assume_abort_if_not(var_1_13 >= -31)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L108]       RET         assume_abort_if_not(var_1_13 >= -31)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L109]       CALL        assume_abort_if_not(var_1_13 <= 31)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L109]       RET         assume_abort_if_not(var_1_13 <= 31)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L110]                   var_1_14 = __VERIFIER_nondet_char()
[L111]       CALL        assume_abort_if_not(var_1_14 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L111]       RET         assume_abort_if_not(var_1_14 >= -63)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L112]       CALL        assume_abort_if_not(var_1_14 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L112]       RET         assume_abort_if_not(var_1_14 <= 63)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L113]                   var_1_17 = __VERIFIER_nondet_double()
[L114]       CALL        assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L114]       RET         assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L115]                   var_1_18 = __VERIFIER_nondet_double()
[L116]       CALL        assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L116]       RET         assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L117]                   var_1_19 = __VERIFIER_nondet_double()
[L118]       CALL        assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L118]       RET         assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L119]                   var_1_20 = __VERIFIER_nondet_double()
[L120]       CALL        assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L120]       RET         assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L135]       RET         updateVariables()
[L136]       CALL        step()
[L47]                    signed long int stepLocal_1 = ~ last_1_var_1_21;
[L48]                    unsigned char stepLocal_0 = var_1_5;
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L49]        EXPR        last_1_var_1_22 >> var_1_4
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L49]        COND TRUE   stepLocal_1 != (last_1_var_1_22 >> var_1_4)
[L50]        COND TRUE   stepLocal_0 || var_1_6
[L51]                    var_1_1 = var_1_4
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L58]        COND FALSE  !(\read(var_1_9))
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L61]                    unsigned short int stepLocal_3 = var_1_1;
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L62]        COND FALSE  !(var_1_4 > stepLocal_3)
[L65]                    var_1_15 = var_1_17
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L67]        COND TRUE   ((- var_1_11) < 8) || var_1_9
[L68]                    var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L70]                    var_1_23 = (var_1_11 + var_1_4)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L71]        COND TRUE   var_1_18 <= var_1_20
[L72]                    var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11))))
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L78]        COND FALSE  !(var_1_6 || var_1_9)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L83]                    signed short int stepLocal_2 = var_1_21;
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L84]        COND TRUE   var_1_10 > stepLocal_2
[L85]                    var_1_12 = ((var_1_4 + var_1_13) + var_1_14)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=8, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L136]       RET         step()
[L137]       CALL, EXPR  property()
[L127]       EXPR        last_1_var_1_22 >> var_1_4
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=8, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L127-L128]              return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1))
;
[L137]       RET, EXPR   property()
[L137]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=8, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=8, var_1_13=-31, var_1_14=39, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 912 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 380 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 121 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 941 NumberOfCodeBlocks, 941 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 1945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 3762/3800 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 19:09:41,922 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 19:09:43,672 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 19:09:43,748 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-03 19:09:43,752 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 19:09:43,752 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 19:09:43,766 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 19:09:43,766 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 19:09:43,767 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 19:09:43,767 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 19:09:43,767 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 19:09:43,767 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 19:09:43,767 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 19:09:43,767 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 19:09:43,767 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 19:09:43,767 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 19:09:43,767 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 19:09:43,767 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 19:09:43,768 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 19:09:43,769 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 19:09:43,770 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:09:43,770 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 19:09:43,770 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-03 19:09:43,771 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-03 19:09:43,771 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 19:09:43,771 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 19:09:43,771 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 19:09:43,771 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 19:09:43,771 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 -> 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f
[2025-03-03 19:09:44,010 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 19:09:44,016 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 19:09:44,017 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 19:09:44,018 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 19:09:44,018 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 19:09:44,019 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i
[2025-03-03 19:09:45,108 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c25d70b/a91191f62f694b7881ee63ef63d50199/FLAGb1d9b434d
[2025-03-03 19:09:45,289 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 19:09:45,290 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i
[2025-03-03 19:09:45,297 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c25d70b/a91191f62f694b7881ee63ef63d50199/FLAGb1d9b434d
[2025-03-03 19:09:45,663 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c25d70b/a91191f62f694b7881ee63ef63d50199
[2025-03-03 19:09:45,665 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 19:09:45,666 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 19:09:45,666 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 19:09:45,667 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 19:09:45,669 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 19:09:45,670 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,670 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acd7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45, skipping insertion in model container
[2025-03-03 19:09:45,670 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,681 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 19:09:45,785 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i[913,926]
[2025-03-03 19:09:45,840 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:09:45,853 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 19:09:45,862 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-13.i[913,926]
[2025-03-03 19:09:45,891 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:09:45,908 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 19:09:45,910 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45 WrapperNode
[2025-03-03 19:09:45,910 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 19:09:45,911 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 19:09:45,911 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 19:09:45,911 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 19:09:45,916 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,926 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,945 INFO  L138                Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137
[2025-03-03 19:09:45,948 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 19:09:45,949 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 19:09:45,949 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 19:09:45,949 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 19:09:45,954 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,954 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,956 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,969 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 19:09:45,971 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,971 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,977 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,977 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,979 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,979 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,983 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 19:09:45,984 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 19:09:45,984 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 19:09:45,984 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 19:09:45,985 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (1/1) ...
[2025-03-03 19:09:45,989 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:09:46,001 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:09:46,010 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 19:09:46,012 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 19:09:46,028 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 19:09:46,028 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-03 19:09:46,028 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 19:09:46,028 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 19:09:46,028 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 19:09:46,028 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 19:09:46,084 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 19:09:46,085 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 19:09:50,802 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2025-03-03 19:09:50,802 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 19:09:50,810 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 19:09:50,810 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 19:09:50,811 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:09:50 BoogieIcfgContainer
[2025-03-03 19:09:50,811 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 19:09:50,812 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 19:09:50,812 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 19:09:50,817 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 19:09:50,817 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:09:45" (1/3) ...
[2025-03-03 19:09:50,817 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46549cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:09:50, skipping insertion in model container
[2025-03-03 19:09:50,817 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:09:45" (2/3) ...
[2025-03-03 19:09:50,818 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46549cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:09:50, skipping insertion in model container
[2025-03-03 19:09:50,818 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:09:50" (3/3) ...
[2025-03-03 19:09:50,819 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-13.i
[2025-03-03 19:09:50,829 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 19:09:50,830 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-13.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 19:09:50,863 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 19:09:50,873 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;@47c5d6ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 19:09:50,874 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 19:09:50,877 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 63 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-03 19:09:50,883 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-03 19:09:50,883 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:50,884 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:50,884 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:50,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:50,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 1670801367, now seen corresponding path program 1 times
[2025-03-03 19:09:50,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:09:50,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513806252]
[2025-03-03 19:09:50,894 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:50,894 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 19:09:50,895 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:09:50,896 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 19:09:50,898 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 19:09:50,965 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-03 19:09:51,165 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-03 19:09:51,165 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:51,165 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:51,176 INFO  L256         TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 19:09:51,191 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:09:51,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked.
[2025-03-03 19:09:51,219 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:09:51,219 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 19:09:51,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513806252]
[2025-03-03 19:09:51,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [513806252] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:09:51,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:09:51,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 19:09:51,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669677454]
[2025-03-03 19:09:51,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:09:51,224 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 19:09:51,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 19:09:51,235 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 19:09:51,235 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 19:09:51,236 INFO  L87              Difference]: Start difference. First operand  has 63 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand  has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-03 19:09:51,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:09:51,250 INFO  L93              Difference]: Finished difference Result 120 states and 203 transitions.
[2025-03-03 19:09:51,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 19:09:51,252 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131
[2025-03-03 19:09:51,252 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:09:51,255 INFO  L225             Difference]: With dead ends: 120
[2025-03-03 19:09:51,255 INFO  L226             Difference]: Without dead ends: 60
[2025-03-03 19:09:51,257 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 19:09:51,258 INFO  L435           NwaCegarLoop]: 88 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, 88 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 19:09:51,259 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:09:51,266 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-03-03 19:09:51,277 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2025-03-03 19:09:51,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2025-03-03 19:09:51,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions.
[2025-03-03 19:09:51,286 INFO  L78                 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 131
[2025-03-03 19:09:51,286 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:09:51,286 INFO  L471      AbstractCegarLoop]: Abstraction has 60 states and 88 transitions.
[2025-03-03 19:09:51,287 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2025-03-03 19:09:51,288 INFO  L276                IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions.
[2025-03-03 19:09:51,289 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-03 19:09:51,290 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:51,290 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:51,300 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 19:09:51,491 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 19:09:51,491 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:51,493 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:51,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 603999443, now seen corresponding path program 1 times
[2025-03-03 19:09:51,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:09:51,494 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054946288]
[2025-03-03 19:09:51,494 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:51,494 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 19:09:51,494 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:09:51,497 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 19:09:51,498 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 19:09:51,537 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-03 19:09:51,745 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-03 19:09:51,745 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:51,745 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:51,756 INFO  L256         TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-03 19:09:51,765 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:09:52,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-03 19:09:52,805 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:09:52,805 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 19:09:52,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054946288]
[2025-03-03 19:09:52,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054946288] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:09:52,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:09:52,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 19:09:52,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151926531]
[2025-03-03 19:09:52,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:09:52,806 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:09:52,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 19:09:52,807 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:09:52,807 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:09:52,807 INFO  L87              Difference]: Start difference. First operand 60 states and 88 transitions. Second operand  has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:54,967 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-03 19:09:56,880 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-03 19:09:56,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:09:56,881 INFO  L93              Difference]: Finished difference Result 175 states and 259 transitions.
[2025-03-03 19:09:56,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:09:56,901 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131
[2025-03-03 19:09:56,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:09:56,902 INFO  L225             Difference]: With dead ends: 175
[2025-03-03 19:09:56,902 INFO  L226             Difference]: Without dead ends: 118
[2025-03-03 19:09:56,904 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 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 19:09:56,904 INFO  L435           NwaCegarLoop]: 83 mSDtfsCounter, 55 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:09:56,904 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 282 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time]
[2025-03-03 19:09:56,905 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-03-03 19:09:56,918 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99.
[2025-03-03 19:09:56,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40)
[2025-03-03 19:09:56,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions.
[2025-03-03 19:09:56,920 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 131
[2025-03-03 19:09:56,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:09:56,920 INFO  L471      AbstractCegarLoop]: Abstraction has 99 states and 146 transitions.
[2025-03-03 19:09:56,920 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:56,920 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions.
[2025-03-03 19:09:56,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-03-03 19:09:56,921 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:56,921 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:56,931 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 19:09:57,122 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 19:09:57,122 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:57,122 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:57,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 125553558, now seen corresponding path program 1 times
[2025-03-03 19:09:57,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:09:57,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165649478]
[2025-03-03 19:09:57,123 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:57,123 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 19:09:57,123 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:09:57,125 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 19:09:57,126 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 19:09:57,162 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-03-03 19:09:57,357 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-03-03 19:09:57,357 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:57,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:57,366 INFO  L256         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 19:09:57,369 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:09:57,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2025-03-03 19:09:57,395 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:09:57,395 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 19:09:57,395 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165649478]
[2025-03-03 19:09:57,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [165649478] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:09:57,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:09:57,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:09:57,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683247101]
[2025-03-03 19:09:57,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:09:57,396 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:09:57,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 19:09:57,397 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:09:57,397 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:09:57,397 INFO  L87              Difference]: Start difference. First operand 99 states and 146 transitions. Second operand  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:58,973 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2025-03-03 19:09:59,037 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:09:59,037 INFO  L93              Difference]: Finished difference Result 187 states and 273 transitions.
[2025-03-03 19:09:59,039 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:09:59,039 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132
[2025-03-03 19:09:59,039 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:09:59,040 INFO  L225             Difference]: With dead ends: 187
[2025-03-03 19:09:59,040 INFO  L226             Difference]: Without dead ends: 130
[2025-03-03 19:09:59,041 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 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 19:09:59,041 INFO  L435           NwaCegarLoop]: 114 mSDtfsCounter, 35 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-03 19:09:59,041 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 192 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-03 19:09:59,042 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2025-03-03 19:09:59,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127.
[2025-03-03 19:09:59,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 127 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46)
[2025-03-03 19:09:59,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions.
[2025-03-03 19:09:59,066 INFO  L78                 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 132
[2025-03-03 19:09:59,066 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:09:59,066 INFO  L471      AbstractCegarLoop]: Abstraction has 127 states and 185 transitions.
[2025-03-03 19:09:59,066 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2025-03-03 19:09:59,066 INFO  L276                IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions.
[2025-03-03 19:09:59,067 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-03-03 19:09:59,067 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:09:59,068 INFO  L218           NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:59,077 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 19:09:59,268 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 19:09:59,268 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:09:59,269 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:09:59,269 INFO  L85        PathProgramCache]: Analyzing trace with hash -167849449, now seen corresponding path program 1 times
[2025-03-03 19:09:59,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 19:09:59,269 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234317953]
[2025-03-03 19:09:59,269 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:09:59,269 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 19:09:59,269 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 19:09:59,271 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 19:09:59,272 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 19:09:59,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-03-03 19:09:59,552 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-03-03 19:09:59,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:09:59,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:09:59,563 INFO  L256         TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-03-03 19:09:59,567 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:10:13,591 WARN  L286               SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-03-03 19:10:19,372 WARN  L286               SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-03-03 19:10:29,236 WARN  L286               SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-03-03 19:10:36,174 WARN  L286               SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-03-03 19:10:47,256 WARN  L286               SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-03-03 19:10:55,358 WARN  L286               SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-03-03 19:11:03,408 WARN  L286               SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-03-03 19:11:11,489 WARN  L286               SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2025-03-03 19:11:19,172 WARN  L286               SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)