./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.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 ca686f9256f657bcea08227d4780b5c57890ba4844680a923775ba3d19048603 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:45:42,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:45:42,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:45:42,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:45:42,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:45:42,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:45:42,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:45:42,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:45:42,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:45:42,500 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:45:42,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:45:42,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:45:42,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:45:42,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:45:42,502 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:45:42,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:45:42,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:45:42,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:45:42,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:45:42,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:45:42,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:45:42,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:45:42,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:45:42,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:45:42,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:45:42,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:45:42,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:45:42,504 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 -> ca686f9256f657bcea08227d4780b5c57890ba4844680a923775ba3d19048603 [2025-03-03 21:45:42,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:45:42,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:45:42,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:45:42,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:45:42,758 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:45:42,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-03 21:45:43,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f459335/a71005204f4b4ae8b97ac52b9d7c9de1/FLAG2ce333b39 [2025-03-03 21:45:44,104 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:45:44,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-03 21:45:44,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f459335/a71005204f4b4ae8b97ac52b9d7c9de1/FLAG2ce333b39 [2025-03-03 21:45:44,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f459335/a71005204f4b4ae8b97ac52b9d7c9de1 [2025-03-03 21:45:44,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:45:44,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:45:44,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:45:44,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:45:44,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:45:44,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bdbc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44, skipping insertion in model container [2025-03-03 21:45:44,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:45:44,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i[919,932] [2025-03-03 21:45:44,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:45:44,617 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:45:44,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i[919,932] [2025-03-03 21:45:44,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:45:44,681 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:45:44,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44 WrapperNode [2025-03-03 21:45:44,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:45:44,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:45:44,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:45:44,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:45:44,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,720 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-03-03 21:45:44,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:45:44,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:45:44,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:45:44,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:45:44,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,748 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 21:45:44,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:45:44,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:45:44,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:45:44,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:45:44,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (1/1) ... [2025-03-03 21:45:44,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:45:44,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:45:44,796 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 21:45:44,802 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 21:45:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:45:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:45:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:45:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:45:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:45:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:45:44,887 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:45:44,889 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:45:45,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~bitwise25#1; [2025-03-03 21:45:45,270 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:45:45,270 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:45:45,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:45:45,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:45:45,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:45 BoogieIcfgContainer [2025-03-03 21:45:45,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:45:45,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:45:45,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:45:45,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:45:45,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:45:44" (1/3) ... [2025-03-03 21:45:45,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4b9112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:45, skipping insertion in model container [2025-03-03 21:45:45,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:44" (2/3) ... [2025-03-03 21:45:45,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4b9112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:45, skipping insertion in model container [2025-03-03 21:45:45,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:45" (3/3) ... [2025-03-03 21:45:45,292 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-03 21:45:45,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:45:45,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:45:45,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:45:45,357 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;@4a0d97f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:45:45,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:45:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:45:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 21:45:45,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:45,373 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:45:45,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 205750900, now seen corresponding path program 1 times [2025-03-03 21:45:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:45:45,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770805095] [2025-03-03 21:45:45,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:45:45,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 21:45:45,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 21:45:45,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:45,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-03 21:45:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:45:45,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770805095] [2025-03-03 21:45:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770805095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:45:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288460489] [2025-03-03 21:45:45,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:45:45,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:45:45,727 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 21:45:45,743 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 21:45:45,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 21:45:45,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 21:45:45,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:45,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:45,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:45:45,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-03 21:45:45,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:45:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288460489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:45:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:45:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076245359] [2025-03-03 21:45:45,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:45,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:45:45,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:45:45,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:45:45,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:45:45,968 INFO L87 Difference]: Start difference. First operand has 103 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:45:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:46,006 INFO L93 Difference]: Finished difference Result 200 states and 352 transitions. [2025-03-03 21:45:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:45:46,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 211 [2025-03-03 21:45:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:46,015 INFO L225 Difference]: With dead ends: 200 [2025-03-03 21:45:46,015 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 21:45:46,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 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 21:45:46,022 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:46,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:45:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 21:45:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-03 21:45:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:45:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2025-03-03 21:45:46,069 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 211 [2025-03-03 21:45:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:46,070 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2025-03-03 21:45:46,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:45:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2025-03-03 21:45:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 21:45:46,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:46,074 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:45:46,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:45:46,274 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 21:45:46,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -198059885, now seen corresponding path program 1 times [2025-03-03 21:45:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:45:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564418389] [2025-03-03 21:45:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:45:46,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 21:45:46,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 21:45:46,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:46,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:45:47,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:45:47,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564418389] [2025-03-03 21:45:47,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564418389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:47,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:45:47,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:45:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136171503] [2025-03-03 21:45:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:47,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:45:47,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:45:47,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:45:47,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:45:47,101 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:45:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:47,574 INFO L93 Difference]: Finished difference Result 309 states and 487 transitions. [2025-03-03 21:45:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:45:47,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-03-03 21:45:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:47,578 INFO L225 Difference]: With dead ends: 309 [2025-03-03 21:45:47,579 INFO L226 Difference]: Without dead ends: 212 [2025-03-03 21:45:47,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:45:47,581 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 136 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:47,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 397 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:45:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-03 21:45:47,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2025-03-03 21:45:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 130 states have (on average 1.4) internal successors, (182), 130 states have internal predecessors, (182), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:45:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 314 transitions. [2025-03-03 21:45:47,621 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 314 transitions. Word has length 211 [2025-03-03 21:45:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:47,621 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 314 transitions. [2025-03-03 21:45:47,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:45:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 314 transitions. [2025-03-03 21:45:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 21:45:47,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:47,628 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:45:47,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:45:47,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:47,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:47,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1037987560, now seen corresponding path program 1 times [2025-03-03 21:45:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:45:47,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647190767] [2025-03-03 21:45:47,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:45:47,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 21:45:47,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 21:45:47,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:47,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:45:47,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:45:47,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647190767] [2025-03-03 21:45:47,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647190767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:47,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:45:47,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:45:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727568776] [2025-03-03 21:45:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:47,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:45:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:45:47,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:45:47,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:45:47,838 INFO L87 Difference]: Start difference. First operand 199 states and 314 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:45:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:47,902 INFO L93 Difference]: Finished difference Result 395 states and 625 transitions. [2025-03-03 21:45:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:45:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-03-03 21:45:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:47,904 INFO L225 Difference]: With dead ends: 395 [2025-03-03 21:45:47,905 INFO L226 Difference]: Without dead ends: 199 [2025-03-03 21:45:47,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:45:47,906 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:47,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 123 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:45:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-03 21:45:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-03 21:45:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 130 states have internal predecessors, (177), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:45:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 309 transitions. [2025-03-03 21:45:47,952 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 309 transitions. Word has length 212 [2025-03-03 21:45:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:47,954 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 309 transitions. [2025-03-03 21:45:47,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:45:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 309 transitions. [2025-03-03 21:45:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 21:45:47,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:47,958 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:45:47,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:45:47,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:47,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1090615817, now seen corresponding path program 1 times [2025-03-03 21:45:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:45:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141657202] [2025-03-03 21:45:47,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:47,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:45:47,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 21:45:47,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 21:45:47,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:47,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:45:48,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:45:48,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141657202] [2025-03-03 21:45:48,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141657202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:48,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:45:48,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:45:48,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250625602] [2025-03-03 21:45:48,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:48,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:45:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:45:48,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:45:48,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:45:48,177 INFO L87 Difference]: Start difference. First operand 199 states and 309 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:45:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:48,387 INFO L93 Difference]: Finished difference Result 507 states and 789 transitions. [2025-03-03 21:45:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:45:48,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-03-03 21:45:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:48,390 INFO L225 Difference]: With dead ends: 507 [2025-03-03 21:45:48,391 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 21:45:48,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:45:48,392 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 139 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:48,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 428 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:45:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 21:45:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 294. [2025-03-03 21:45:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 191 states have (on average 1.356020942408377) internal successors, (259), 191 states have internal predecessors, (259), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 21:45:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 457 transitions. [2025-03-03 21:45:48,437 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 457 transitions. Word has length 213 [2025-03-03 21:45:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:48,438 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 457 transitions. [2025-03-03 21:45:48,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:45:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 457 transitions. [2025-03-03 21:45:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 21:45:48,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:48,440 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:45:48,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:45:48,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:48,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1586447451, now seen corresponding path program 1 times [2025-03-03 21:45:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:45:48,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049817223] [2025-03-03 21:45:48,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:45:48,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 21:45:48,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 21:45:48,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:48,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:45:48,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:45:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049817223] [2025-03-03 21:45:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049817223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:45:48,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:45:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:45:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379495902] [2025-03-03 21:45:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:45:48,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:45:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:45:48,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:45:48,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:45:48,853 INFO L87 Difference]: Start difference. First operand 294 states and 457 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:45:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:48,959 INFO L93 Difference]: Finished difference Result 660 states and 1027 transitions. [2025-03-03 21:45:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:45:48,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-03-03 21:45:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:48,963 INFO L225 Difference]: With dead ends: 660 [2025-03-03 21:45:48,963 INFO L226 Difference]: Without dead ends: 369 [2025-03-03 21:45:48,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:45:48,964 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 54 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:48,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 252 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:45:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-03 21:45:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 360. [2025-03-03 21:45:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 223 states have (on average 1.3228699551569507) internal successors, (295), 223 states have internal predecessors, (295), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 21:45:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 559 transitions. [2025-03-03 21:45:49,009 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 559 transitions. Word has length 213 [2025-03-03 21:45:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:49,010 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 559 transitions. [2025-03-03 21:45:49,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:45:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 559 transitions. [2025-03-03 21:45:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 21:45:49,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:49,012 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:45:49,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:45:49,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:49,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1984752687, now seen corresponding path program 1 times [2025-03-03 21:45:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:45:49,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524171697] [2025-03-03 21:45:49,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:45:49,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:45:49,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:45:49,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:49,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:45:49,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:45:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524171697] [2025-03-03 21:45:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524171697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:45:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566873174] [2025-03-03 21:45:49,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:49,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:45:49,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:45:49,544 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 21:45:49,546 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 21:45:49,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 21:45:49,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 21:45:49,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:49,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:45:49,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 21:45:49,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:45:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1028 proven. 60 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2025-03-03 21:45:50,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:45:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-03 21:45:51,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566873174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:45:51,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:45:51,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 23 [2025-03-03 21:45:51,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417325486] [2025-03-03 21:45:51,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:45:51,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 21:45:51,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:45:51,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 21:45:51,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:45:51,848 INFO L87 Difference]: Start difference. First operand 360 states and 559 transitions. Second operand has 23 states, 21 states have (on average 6.380952380952381) internal successors, (134), 23 states have internal predecessors, (134), 9 states have call successors, (99), 4 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 9 states have call successors, (99) [2025-03-03 21:45:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:45:54,737 INFO L93 Difference]: Finished difference Result 936 states and 1405 transitions. [2025-03-03 21:45:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 21:45:54,737 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.380952380952381) internal successors, (134), 23 states have internal predecessors, (134), 9 states have call successors, (99), 4 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 9 states have call successors, (99) Word has length 215 [2025-03-03 21:45:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:45:54,743 INFO L225 Difference]: With dead ends: 936 [2025-03-03 21:45:54,744 INFO L226 Difference]: Without dead ends: 642 [2025-03-03 21:45:54,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=879, Invalid=3153, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 21:45:54,746 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1089 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:45:54,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 621 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 21:45:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-03 21:45:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 502. [2025-03-03 21:45:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 322 states have (on average 1.2919254658385093) internal successors, (416), 322 states have internal predecessors, (416), 165 states have call successors, (165), 14 states have call predecessors, (165), 14 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-03 21:45:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 746 transitions. [2025-03-03 21:45:54,827 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 746 transitions. Word has length 215 [2025-03-03 21:45:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:45:54,829 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 746 transitions. [2025-03-03 21:45:54,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.380952380952381) internal successors, (134), 23 states have internal predecessors, (134), 9 states have call successors, (99), 4 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 9 states have call successors, (99) [2025-03-03 21:45:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 746 transitions. [2025-03-03 21:45:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 21:45:54,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:45:54,831 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:45:54,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:45:55,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 21:45:55,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:45:55,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:45:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash 463904751, now seen corresponding path program 1 times [2025-03-03 21:45:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:45:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750333387] [2025-03-03 21:45:55,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:45:55,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 21:45:55,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 21:45:55,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:55,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:45:55,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1383912486] [2025-03-03 21:45:55,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:45:55,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:45:55,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:45:55,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:45:55,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:45:55,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 21:45:55,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 21:45:55,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:55,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:45:55,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:45:55,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 21:45:55,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 21:45:55,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:45:55,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:45:55,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:45:55,501 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:45:55,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:45:55,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 21:45:55,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:45:55,706 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:45:55,814 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:45:55,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:45:55 BoogieIcfgContainer [2025-03-03 21:45:55,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:45:55,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:45:55,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:45:55,820 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:45:55,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:45" (3/4) ... [2025-03-03 21:45:55,821 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:45:55,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:45:55,823 INFO L158 Benchmark]: Toolchain (without parser) took 11393.55ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 122.7MB in the beginning and 157.2MB in the end (delta: -34.5MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. [2025-03-03 21:45:55,823 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:45:55,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.04ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 106.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:45:55,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.77ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 103.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:45:55,824 INFO L158 Benchmark]: Boogie Preprocessor took 44.00ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 98.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:45:55,824 INFO L158 Benchmark]: IcfgBuilder took 519.80ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 65.8MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 21:45:55,825 INFO L158 Benchmark]: TraceAbstraction took 10532.03ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 65.8MB in the beginning and 157.3MB in the end (delta: -91.6MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2025-03-03 21:45:55,825 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 352.3MB. Free memory was 157.3MB in the beginning and 157.2MB in the end (delta: 110.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:45:55,826 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.16ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.04ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 106.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.77ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 103.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.00ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 98.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 519.80ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 65.8MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10532.03ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 65.8MB in the beginning and 157.3MB in the end (delta: -91.6MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 352.3MB. Free memory was 157.3MB in the beginning and 157.2MB in the end (delta: 110.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 128, overapproximation of someBinaryArithmeticDOUBLEoperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of bitwiseOr at line 74, overapproximation of bitwiseAnd at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -10; [L24] signed short int var_1_5 = 100; [L25] double var_1_6 = 0.5; [L26] double var_1_7 = 16.5; [L27] double var_1_8 = 7.4; [L28] unsigned short int var_1_9 = 4; [L29] unsigned char var_1_10 = 0; [L30] unsigned long int var_1_11 = 1000000000; [L31] unsigned short int var_1_12 = 256; [L32] signed short int var_1_13 = 16; [L33] signed short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 63836; [L35] unsigned short int var_1_16 = 10; [L36] signed char var_1_17 = -8; [L37] signed char var_1_18 = 8; [L38] signed short int var_1_19 = 50; [L39] signed short int var_1_20 = 10; [L40] signed short int var_1_21 = 10000; [L41] signed char var_1_22 = -2; [L42] float var_1_23 = 3.2; [L43] unsigned long int var_1_27 = 2686167646; [L44] unsigned char var_1_30 = 16; [L45] unsigned char var_1_31 = 0; [L46] signed long int var_1_32 = -2; [L47] unsigned short int var_1_33 = 1; [L48] unsigned long int var_1_34 = 3877983372; [L49] double var_1_35 = 16.75; [L50] double var_1_36 = 0.0; [L51] double var_1_37 = 99999.6; [L52] float var_1_38 = 25.6; [L53] float var_1_39 = 8.75; [L54] signed long int last_1_var_1_1 = -64; VAL [isInitial=0, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L133] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L135] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L135] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L136] var_1_5 = __VERIFIER_nondet_short() [L137] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L137] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L138] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L138] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L139] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L139] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L140] var_1_7 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L141] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L142] var_1_8 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L143] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L144] var_1_10 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L145] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L146] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L147] var_1_13 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L148] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L149] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L150] var_1_14 = __VERIFIER_nondet_short() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L152] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L153] var_1_15 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L154] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L155] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L156] var_1_16 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L157] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L158] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L159] var_1_18 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L160] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L161] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L162] var_1_20 = __VERIFIER_nondet_short() [L163] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L163] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L164] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L164] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L165] var_1_21 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L166] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L167] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L167] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L168] var_1_27 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L169] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L170] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L171] var_1_31 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L172] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L173] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L174] var_1_34 = __VERIFIER_nondet_ulong() [L175] CALL assume_abort_if_not(var_1_34 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L175] RET assume_abort_if_not(var_1_34 >= 3221225471) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L176] CALL assume_abort_if_not(var_1_34 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L176] RET assume_abort_if_not(var_1_34 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L177] var_1_36 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_36 >= 4611686.018427382800e+12F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L178] RET assume_abort_if_not((var_1_36 >= 4611686.018427382800e+12F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L179] var_1_37 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L180] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L181] var_1_39 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L182] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L196] RET updateVariables() [L197] CALL step() [L58] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_9=4] [L58] COND FALSE !(((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) > (2u)) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (2u))) > (var_1_11 & var_1_12)) [L67] var_1_23 = var_1_8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=16, var_1_31=254, var_1_32=-2, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L69] var_1_30 = var_1_31 [L70] var_1_32 = var_1_31 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=1, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L71] COND TRUE var_1_16 <= ((var_1_34 - var_1_31) - ((((var_1_12) < (var_1_21)) ? (var_1_12) : (var_1_21)))) [L72] var_1_33 = 128 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L74] EXPR var_1_1 | var_1_11 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_35=67/4, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L74] COND TRUE (var_1_1 | var_1_11) > var_1_14 [L75] COND TRUE -16 <= (((((var_1_12 - var_1_31)) > (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? ((var_1_12 - var_1_31)) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))) [L76] var_1_35 = (63.2 - 7.4) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_38=128/5, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L83] COND FALSE !(var_1_27 < var_1_34) [L90] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L92] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1 [L93] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L95] var_1_11 = (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))))) [L96] unsigned short int stepLocal_3 = var_1_12; [L97] unsigned short int stepLocal_2 = var_1_12; [L98] unsigned short int stepLocal_1 = var_1_12; [L99] unsigned long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L100] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L100] COND TRUE stepLocal_3 <= ((var_1_11 / var_1_4) & 8) [L101] COND FALSE !(-16 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L115] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L120] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L121] COND TRUE var_1_13 <= var_1_11 [L122] var_1_19 = ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L126] var_1_22 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_6=1/2, var_1_8=2, var_1_9=4] [L127] COND TRUE var_1_19 <= var_1_1 [L128] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_8=2, var_1_9=4] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_8=2, var_1_9=4] [L188-L189] return ((((((((var_1_12 <= ((var_1_11 / var_1_4) & 8)) ? ((-16 <= var_1_11) ? ((var_1_12 != (var_1_11 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : (var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : 1) : ((var_1_11 <= var_1_12) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_11)))) && ((var_1_19 <= var_1_1) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_12 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_11) ? (var_1_19 == ((signed short int) ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_12)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_12))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_8=2, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=32767, var_1_16=-32769, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=2, var_1_27=3221225471, var_1_30=254, var_1_31=254, var_1_32=254, var_1_33=128, var_1_34=-1073741825, var_1_36=3, var_1_38=3, var_1_4=-64, var_1_5=-32, var_1_8=2, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 7, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1509 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1509 mSDsluCounter, 1973 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1164 mSDsCounter, 809 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2103 IncrementalHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 809 mSolverCounterUnsat, 809 mSDtfsCounter, 2103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 720 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=502occurred in iteration=6, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 171 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2133 NumberOfCodeBlocks, 2133 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1907 ConstructedInterpolants, 0 QuantifiedInterpolants, 9964 SizeOfPredicates, 3 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 18764/19008 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 21:45:55,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.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 ca686f9256f657bcea08227d4780b5c57890ba4844680a923775ba3d19048603 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:45:57,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:45:57,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:45:57,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:45:57,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:45:57,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:45:57,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:45:57,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:45:57,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:45:57,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:45:57,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:45:57,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:45:57,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:45:57,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:45:57,791 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:45:57,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:45:57,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:45:57,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:45:57,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:45:57,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:45:57,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:45:57,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:45:57,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:45:57,792 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:45:57,792 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:45:57,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:45:57,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:45:57,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:45:57,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:45:57,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:45:57,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:45:57,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:45:57,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:45:57,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:45:57,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:45:57,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:45:57,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:45:57,795 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 -> ca686f9256f657bcea08227d4780b5c57890ba4844680a923775ba3d19048603 [2025-03-03 21:45:58,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:45:58,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:45:58,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:45:58,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:45:58,073 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:45:58,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-03 21:45:59,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899a108b9/038507373ed44a2794f51e5f49160b88/FLAG874a40570 [2025-03-03 21:45:59,461 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:45:59,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-03 21:45:59,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899a108b9/038507373ed44a2794f51e5f49160b88/FLAG874a40570 [2025-03-03 21:45:59,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899a108b9/038507373ed44a2794f51e5f49160b88 [2025-03-03 21:45:59,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:45:59,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:45:59,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:45:59,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:45:59,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:45:59,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efc5768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59, skipping insertion in model container [2025-03-03 21:45:59,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:45:59,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i[919,932] [2025-03-03 21:45:59,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:45:59,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:45:59,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i[919,932] [2025-03-03 21:45:59,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:45:59,768 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:45:59,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59 WrapperNode [2025-03-03 21:45:59,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:45:59,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:45:59,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:45:59,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:45:59,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,816 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-03-03 21:45:59,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:45:59,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:45:59,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:45:59,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:45:59,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,845 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 21:45:59,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:45:59,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:45:59,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:45:59,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:45:59,868 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (1/1) ... [2025-03-03 21:45:59,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:45:59,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:45:59,894 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 21:45:59,897 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 21:45:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:45:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:45:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:45:59,917 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:45:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:45:59,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:45:59,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:45:59,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:46:04,280 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:46:04,280 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:46:04,290 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:46:04,290 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:46:04,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:46:04 BoogieIcfgContainer [2025-03-03 21:46:04,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:46:04,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:46:04,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:46:04,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:46:04,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:45:59" (1/3) ... [2025-03-03 21:46:04,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759925c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:46:04, skipping insertion in model container [2025-03-03 21:46:04,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:59" (2/3) ... [2025-03-03 21:46:04,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759925c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:46:04, skipping insertion in model container [2025-03-03 21:46:04,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:46:04" (3/3) ... [2025-03-03 21:46:04,302 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i [2025-03-03 21:46:04,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:46:04,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-98.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:46:04,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:46:04,378 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;@3a477da2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:46:04,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:46:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:46:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:46:04,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:46:04,394 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:46:04,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:46:04,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:46:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1087887284, now seen corresponding path program 1 times [2025-03-03 21:46:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:46:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247981952] [2025-03-03 21:46:04,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:04,407 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 21:46:04,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:46:04,410 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 21:46:04,411 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 21:46:04,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:46:04,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:46:04,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:04,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:04,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:46:04,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-03-03 21:46:04,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:46:04,915 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:46:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247981952] [2025-03-03 21:46:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247981952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:46:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:46:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:46:04,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784939321] [2025-03-03 21:46:04,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:46:04,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:46:04,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:46:04,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:46:04,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:46:04,942 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:46:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:46:04,961 INFO L93 Difference]: Finished difference Result 174 states and 310 transitions. [2025-03-03 21:46:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:46:04,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 206 [2025-03-03 21:46:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:46:04,967 INFO L225 Difference]: With dead ends: 174 [2025-03-03 21:46:04,967 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 21:46:04,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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 21:46:04,972 INFO L435 NwaCegarLoop]: 136 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, 136 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 21:46:04,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:46:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 21:46:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 21:46:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 21:46:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2025-03-03 21:46:05,004 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 206 [2025-03-03 21:46:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:46:05,004 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2025-03-03 21:46:05,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:46:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2025-03-03 21:46:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 21:46:05,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:46:05,008 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:46:05,022 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 21:46:05,208 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 21:46:05,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:46:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:46:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash -653923787, now seen corresponding path program 1 times [2025-03-03 21:46:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:46:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910686138] [2025-03-03 21:46:05,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:05,210 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 21:46:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:46:05,212 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 21:46:05,213 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 21:46:05,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 21:46:05,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 21:46:05,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:05,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:05,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:46:05,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:46:07,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:46:07,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:46:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910686138] [2025-03-03 21:46:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910686138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:46:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:46:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:46:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450771931] [2025-03-03 21:46:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:46:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:46:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:46:07,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:46:07,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:46:07,213 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:46:12,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:46:13,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:46:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:46:14,031 INFO L93 Difference]: Finished difference Result 239 states and 378 transitions. [2025-03-03 21:46:14,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:46:14,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-03 21:46:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:46:14,039 INFO L225 Difference]: With dead ends: 239 [2025-03-03 21:46:14,039 INFO L226 Difference]: Without dead ends: 155 [2025-03-03 21:46:14,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 204 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 21:46:14,040 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:46:14,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 229 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-03-03 21:46:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-03 21:46:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2025-03-03 21:46:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:46:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 236 transitions. [2025-03-03 21:46:14,069 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 236 transitions. Word has length 206 [2025-03-03 21:46:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:46:14,070 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 236 transitions. [2025-03-03 21:46:14,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:46:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 236 transitions. [2025-03-03 21:46:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 21:46:14,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:46:14,074 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:46:14,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:46:14,275 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 21:46:14,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:46:14,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:46:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1000149329, now seen corresponding path program 1 times [2025-03-03 21:46:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:46:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188757634] [2025-03-03 21:46:14,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:14,278 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 21:46:14,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:46:14,281 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 21:46:14,284 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 21:46:14,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:46:14,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:46:14,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:14,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:14,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:46:14,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-03 21:46:15,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:46:16,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:46:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188757634] [2025-03-03 21:46:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188757634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:46:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2108440258] [2025-03-03 21:46:16,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:16,025 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:46:16,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:46:16,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:46:16,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 21:46:16,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:46:17,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:46:17,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:17,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:17,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:46:17,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:46:17,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:46:17,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2108440258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:46:17,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:46:17,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 21:46:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990872422] [2025-03-03 21:46:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:46:17,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:46:17,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:46:17,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:46:17,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:46:17,632 INFO L87 Difference]: Start difference. First operand 151 states and 236 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:46:20,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:46:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:46:20,390 INFO L93 Difference]: Finished difference Result 317 states and 498 transitions. [2025-03-03 21:46:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:46:20,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-03 21:46:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:46:20,408 INFO L225 Difference]: With dead ends: 317 [2025-03-03 21:46:20,408 INFO L226 Difference]: Without dead ends: 233 [2025-03-03 21:46:20,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:46:20,409 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 30 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:46:20,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 364 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 21:46:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-03 21:46:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2025-03-03 21:46:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 122 states have internal predecessors, (154), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 21:46:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 352 transitions. [2025-03-03 21:46:20,440 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 352 transitions. Word has length 207 [2025-03-03 21:46:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:46:20,441 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 352 transitions. [2025-03-03 21:46:20,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:46:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 352 transitions. [2025-03-03 21:46:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 21:46:20,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:46:20,443 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:46:20,457 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 21:46:20,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-03 21:46:20,844 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:46:20,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:46:20,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:46:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -993315535, now seen corresponding path program 1 times [2025-03-03 21:46:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:46:20,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956740368] [2025-03-03 21:46:20,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:20,845 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 21:46:20,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:46:20,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:46:20,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 21:46:20,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:46:21,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:46:21,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:21,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:21,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:46:21,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-03 21:46:22,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:46:22,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:46:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956740368] [2025-03-03 21:46:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956740368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:46:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2121120120] [2025-03-03 21:46:22,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:22,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:46:22,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:46:22,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:46:22,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-03 21:46:22,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:46:23,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:46:23,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:23,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:23,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:46:23,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:46:23,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:46:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2121120120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:46:23,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:46:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 21:46:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362578093] [2025-03-03 21:46:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:46:23,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:46:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:46:23,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:46:23,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:46:23,638 INFO L87 Difference]: Start difference. First operand 225 states and 352 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:46:25,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:46:27,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:46:29,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:46:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:46:29,457 INFO L93 Difference]: Finished difference Result 402 states and 630 transitions. [2025-03-03 21:46:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:46:29,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-03 21:46:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:46:29,473 INFO L225 Difference]: With dead ends: 402 [2025-03-03 21:46:29,473 INFO L226 Difference]: Without dead ends: 238 [2025-03-03 21:46:29,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:46:29,474 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 85 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:46:29,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 448 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-03-03 21:46:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-03 21:46:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 167. [2025-03-03 21:46:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 21:46:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-03-03 21:46:29,497 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 207 [2025-03-03 21:46:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:46:29,500 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-03-03 21:46:29,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:46:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-03-03 21:46:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 21:46:29,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:46:29,502 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:46:29,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-03 21:46:29,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-03 21:46:29,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:46:29,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:46:29,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:46:29,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1189829040, now seen corresponding path program 1 times [2025-03-03 21:46:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:46:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107859252] [2025-03-03 21:46:29,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:29,904 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 21:46:29,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:46:29,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:46:29,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-03 21:46:29,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:46:30,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:46:30,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:30,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:30,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:46:30,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-03 21:46:30,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:46:30,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:46:30,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107859252] [2025-03-03 21:46:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107859252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:46:30,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1276041355] [2025-03-03 21:46:30,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:30,915 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:46:30,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:46:30,916 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:46:30,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-03 21:46:30,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 21:46:31,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 21:46:31,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:31,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:31,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:46:31,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-03 21:46:32,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:46:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1276041355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:46:32,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:46:32,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-03 21:46:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617084730] [2025-03-03 21:46:32,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:46:32,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:46:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:46:32,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:46:32,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:46:32,740 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:46:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:46:35,921 INFO L93 Difference]: Finished difference Result 497 states and 769 transitions. [2025-03-03 21:46:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:46:35,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2025-03-03 21:46:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:46:35,938 INFO L225 Difference]: With dead ends: 497 [2025-03-03 21:46:35,938 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 21:46:35,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:46:35,939 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:46:35,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 447 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 21:46:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 21:46:35,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2025-03-03 21:46:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 183 states have (on average 1.273224043715847) internal successors, (233), 183 states have internal predecessors, (233), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 21:46:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 497 transitions. [2025-03-03 21:46:35,963 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 497 transitions. Word has length 207 [2025-03-03 21:46:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:46:35,964 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 497 transitions. [2025-03-03 21:46:35,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 21:46:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 497 transitions. [2025-03-03 21:46:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 21:46:35,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:46:35,966 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:46:35,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-03 21:46:36,180 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 (8)] Ended with exit code 0 [2025-03-03 21:46:36,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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 21:46:36,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:46:36,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:46:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1831597548, now seen corresponding path program 1 times [2025-03-03 21:46:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:46:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133924630] [2025-03-03 21:46:36,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:36,368 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 21:46:36,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:46:36,369 INFO L229 MonitoredProcess]: Starting monitored process 10 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 21:46:36,370 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 (10)] Waiting until timeout for monitored process [2025-03-03 21:46:36,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 21:46:36,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 21:46:36,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:36,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:36,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:46:36,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:46:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 21:46:36,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:46:36,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:46:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133924630] [2025-03-03 21:46:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133924630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:46:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:46:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:46:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680843173] [2025-03-03 21:46:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:46:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:46:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:46:36,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:46:36,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:46:36,807 INFO L87 Difference]: Start difference. First operand 322 states and 497 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:46:38,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:46:41,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:46:43,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:46:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:46:45,164 INFO L93 Difference]: Finished difference Result 574 states and 891 transitions. [2025-03-03 21:46:45,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:46:45,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-03-03 21:46:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:46:45,179 INFO L225 Difference]: With dead ends: 574 [2025-03-03 21:46:45,179 INFO L226 Difference]: Without dead ends: 410 [2025-03-03 21:46:45,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:46:45,180 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 214 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:46:45,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 597 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-03-03 21:46:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-03 21:46:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 402. [2025-03-03 21:46:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 229 states have (on average 1.2707423580786026) internal successors, (291), 229 states have internal predecessors, (291), 165 states have call successors, (165), 7 states have call predecessors, (165), 7 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-03 21:46:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 621 transitions. [2025-03-03 21:46:45,222 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 621 transitions. Word has length 208 [2025-03-03 21:46:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:46:45,223 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 621 transitions. [2025-03-03 21:46:45,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 21:46:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 621 transitions. [2025-03-03 21:46:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 21:46:45,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:46:45,225 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:46:45,241 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 (10)] Ended with exit code 0 [2025-03-03 21:46:45,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 21:46:45,426 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:46:45,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:46:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1830674027, now seen corresponding path program 1 times [2025-03-03 21:46:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:46:45,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437712699] [2025-03-03 21:46:45,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:46:45,427 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 21:46:45,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:46:45,429 INFO L229 MonitoredProcess]: Starting monitored process 11 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 21:46:45,430 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 (11)] Waiting until timeout for monitored process [2025-03-03 21:46:45,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 21:46:45,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 21:46:45,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:46:45,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:46:45,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 21:46:45,799 INFO L279 TraceCheckSpWp]: Computing forward predicates...