./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-41.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-pe-ci_file-41.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 bb30cb0b4398adfc5465f31f9ffe7fe240953900dbbefc0594f1922929c32c0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:28:49,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:28:49,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:28:49,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:28:49,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:28:49,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:28:49,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:28:49,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:28:49,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:28:49,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:28:49,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:28:49,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:28:49,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:28:49,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:28:49,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:28:49,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:28:49,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:28:49,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:28:49,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:28:49,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:28:49,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:49,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:28:49,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:28:49,661 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 -> bb30cb0b4398adfc5465f31f9ffe7fe240953900dbbefc0594f1922929c32c0a [2025-03-03 20:28:49,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:28:49,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:28:49,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:28:49,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:28:49,896 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:28:49,898 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-pe-ci_file-41.i [2025-03-03 20:28:51,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa39902a8/18a0631f05124b8ba7f3168624c0fb2a/FLAG295933a3c [2025-03-03 20:28:51,228 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:28:51,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-41.i [2025-03-03 20:28:51,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa39902a8/18a0631f05124b8ba7f3168624c0fb2a/FLAG295933a3c [2025-03-03 20:28:51,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa39902a8/18a0631f05124b8ba7f3168624c0fb2a [2025-03-03 20:28:51,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:28:51,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:28:51,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:51,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:28:51,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:28:51,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afed566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51, skipping insertion in model container [2025-03-03 20:28:51,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:28:51,351 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-pe-ci_file-41.i[919,932] [2025-03-03 20:28:51,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:51,402 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:28:51,409 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-pe-ci_file-41.i[919,932] [2025-03-03 20:28:51,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:51,438 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:28:51,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51 WrapperNode [2025-03-03 20:28:51,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:51,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:51,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:28:51,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:28:51,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,490 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2025-03-03 20:28:51,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:51,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:28:51,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:28:51,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:28:51,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,527 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 20:28:51,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:28:51,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:28:51,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:28:51,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:28:51,554 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (1/1) ... [2025-03-03 20:28:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:51,579 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 20:28:51,582 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 20:28:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:28:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:28:51,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:28:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:28:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:28:51,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:28:51,661 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:28:51,662 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:28:51,992 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 20:28:51,992 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:28:52,004 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:28:52,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:28:52,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:52 BoogieIcfgContainer [2025-03-03 20:28:52,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:28:52,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:28:52,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:28:52,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:28:52,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:28:51" (1/3) ... [2025-03-03 20:28:52,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65be48dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:52, skipping insertion in model container [2025-03-03 20:28:52,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:51" (2/3) ... [2025-03-03 20:28:52,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65be48dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:52, skipping insertion in model container [2025-03-03 20:28:52,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:52" (3/3) ... [2025-03-03 20:28:52,014 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-41.i [2025-03-03 20:28:52,024 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:28:52,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-41.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:28:52,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:28:52,068 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;@1a3bdef8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:28:52,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:28:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 20:28:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 20:28:52,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:52,079 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:52,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:52,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1641362114, now seen corresponding path program 1 times [2025-03-03 20:28:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196874950] [2025-03-03 20:28:52,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:52,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 20:28:52,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 20:28:52,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:52,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 20:28:52,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:52,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196874950] [2025-03-03 20:28:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196874950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:28:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083932493] [2025-03-03 20:28:52,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:52,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:52,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:52,342 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 20:28:52,344 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 20:28:52,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 20:28:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 20:28:52,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:52,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:52,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:28:52,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 20:28:52,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:28:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083932493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:52,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:28:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:28:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854127703] [2025-03-03 20:28:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:52,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:28:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:52,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:28:52,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:28:52,536 INFO L87 Difference]: Start difference. First operand has 77 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 20:28:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:52,563 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2025-03-03 20:28:52,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:28:52,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2025-03-03 20:28:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:52,572 INFO L225 Difference]: With dead ends: 148 [2025-03-03 20:28:52,572 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 20:28:52,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:28:52,577 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:52,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 20:28:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-03 20:28:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 20:28:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2025-03-03 20:28:52,610 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 134 [2025-03-03 20:28:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:52,610 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2025-03-03 20:28:52,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 20:28:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2025-03-03 20:28:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 20:28:52,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:52,613 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:52,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:28:52,815 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 20:28:52,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:52,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash -608475319, now seen corresponding path program 1 times [2025-03-03 20:28:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048064624] [2025-03-03 20:28:52,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:52,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 20:28:53,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 20:28:53,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:53,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:28:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548772283] [2025-03-03 20:28:53,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:53,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:53,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:53,034 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 20:28:53,036 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 20:28:53,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 20:28:53,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 20:28:53,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:53,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:53,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:28:53,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 348 proven. 21 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-03 20:28:53,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:28:53,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048064624] [2025-03-03 20:28:53,989 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:28:53,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548772283] [2025-03-03 20:28:53,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548772283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:28:53,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:28:53,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-03 20:28:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327888715] [2025-03-03 20:28:53,989 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 20:28:53,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:28:53,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:53,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:28:53,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:28:53,992 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 20:28:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:54,174 INFO L93 Difference]: Finished difference Result 151 states and 228 transitions. [2025-03-03 20:28:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:28:54,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2025-03-03 20:28:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:54,176 INFO L225 Difference]: With dead ends: 151 [2025-03-03 20:28:54,176 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 20:28:54,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:28:54,177 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 65 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:54,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 278 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:28:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 20:28:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-03-03 20:28:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 20:28:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2025-03-03 20:28:54,192 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 134 [2025-03-03 20:28:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:54,194 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2025-03-03 20:28:54,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 20:28:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2025-03-03 20:28:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 20:28:54,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:54,196 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:54,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:28:54,397 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,SelfDestructingSolverStorable1 [2025-03-03 20:28:54,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:54,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash 270212499, now seen corresponding path program 1 times [2025-03-03 20:28:54,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:54,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331278496] [2025-03-03 20:28:54,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:54,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:54,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 20:28:54,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 20:28:54,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:28:54,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [89172806] [2025-03-03 20:28:54,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:54,578 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 20:28:54,580 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 20:28:54,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 20:28:54,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 20:28:54,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:54,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:28:54,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:28:54,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 20:28:54,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 20:28:54,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:54,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:28:55,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:28:55,013 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:28:55,014 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:28:55,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:28:55,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:55,219 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 20:28:55,307 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:28:55,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:28:55 BoogieIcfgContainer [2025-03-03 20:28:55,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:28:55,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:28:55,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:28:55,311 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:28:55,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:52" (3/4) ... [2025-03-03 20:28:55,314 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:28:55,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:28:55,315 INFO L158 Benchmark]: Toolchain (without parser) took 4067.78ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 60.8MB in the end (delta: 44.9MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2025-03-03 20:28:55,315 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:55,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.61ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 90.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:28:55,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.71ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:55,316 INFO L158 Benchmark]: Boogie Preprocessor took 57.93ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 80.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:28:55,316 INFO L158 Benchmark]: IcfgBuilder took 454.05ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 54.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 20:28:55,316 INFO L158 Benchmark]: TraceAbstraction took 3301.88ms. Allocated memory is still 142.6MB. Free memory was 53.9MB in the beginning and 60.8MB in the end (delta: -7.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:55,316 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 60.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:55,317 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.61ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 90.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.71ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.93ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 80.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 454.05ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 54.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3301.88ms. Allocated memory is still 142.6MB. Free memory was 53.9MB in the beginning and 60.8MB in the end (delta: -7.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 60.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryArithmeticFLOAToperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] signed short int var_1_24 = 25; [L39] unsigned char var_1_27 = 50; [L40] signed short int var_1_29 = 10; [L41] double var_1_33 = 7.125; [L42] float var_1_34 = 0.75; [L43] float var_1_35 = 25.5; [L44] float var_1_36 = 9.038; [L45] float var_1_39 = 128.5; [L46] float var_1_41 = 15.25; [L47] float var_1_42 = 64.5; [L48] float var_1_43 = 256.3; [L49] unsigned long int var_1_44 = 32; [L50] double var_1_45 = 63.25; [L51] unsigned char last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L169] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L179] RET updateLastVariables() [L180] CALL updateVariables() [L135] var_1_4 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L136] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L137] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L137] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L138] var_1_5 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L139] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L141] var_1_11 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L142] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L144] var_1_12 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L145] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L147] var_1_14 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L149] var_1_16 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L150] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L151] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L151] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L152] var_1_18 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L153] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L154] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L154] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L155] var_1_34 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L156] RET assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L157] var_1_35 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L158] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L159] var_1_36 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L160] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L161] var_1_41 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L162] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L163] var_1_42 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L164] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L165] var_1_43 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L166] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L180] RET updateVariables() [L181] CALL step() [L55] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L56] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L63] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L68] COND TRUE (- var_1_13) > 31.9f [L69] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L73] COND TRUE \read(var_1_1) [L74] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L76] var_1_22 = 1 [L77] var_1_23 = var_1_22 [L78] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L79] COND FALSE !(var_1_15 > stepLocal_0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L82] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=0, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=2, var_1_18=-57344, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L83] COND TRUE var_1_1 || stepLocal_2 [L84] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L88] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L89] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] COND FALSE !(! (var_1_17 <= var_1_17)) [L95] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L98] COND TRUE 32.2f > (25.5f - ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) [L99] var_1_24 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L101] var_1_27 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L102] COND FALSE !(var_1_13 <= ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L109] COND FALSE !(var_1_13 > (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - var_1_36)) [L118] var_1_33 = 10000.5 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] COND TRUE \read(var_1_5) [L121] var_1_39 = var_1_14 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] COND TRUE ((var_1_14 + var_1_13) * ((((var_1_42) < 0 ) ? -(var_1_42) : (var_1_42)))) >= var_1_35 [L128] var_1_44 = ((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=8192, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L130] COND TRUE \read(var_1_5) [L131] var_1_45 = (((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) + var_1_42) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=8192, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=8192, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=8192, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-127, var_1_12=8, var_1_13=8/5, var_1_14=2, var_1_15=1, var_1_16=1, var_1_17=8193, var_1_18=-57344, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_24=8192, var_1_27=1, var_1_29=10, var_1_33=20001/2, var_1_39=2, var_1_44=8192, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 197 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 621 SizeOfPredicates, 2 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1995/2052 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 20:28:55,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-41.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 bb30cb0b4398adfc5465f31f9ffe7fe240953900dbbefc0594f1922929c32c0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:28:57,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:28:57,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:28:57,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:28:57,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:28:57,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:28:57,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:28:57,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:28:57,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:28:57,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:28:57,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:28:57,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:28:57,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:28:57,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:28:57,300 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:28:57,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:28:57,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:28:57,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:28:57,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:28:57,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:28:57,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:28:57,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:28:57,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:28:57,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:57,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:28:57,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:28:57,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:28:57,302 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 -> bb30cb0b4398adfc5465f31f9ffe7fe240953900dbbefc0594f1922929c32c0a [2025-03-03 20:28:57,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:28:57,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:28:57,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:28:57,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:28:57,545 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:28:57,546 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-pe-ci_file-41.i [2025-03-03 20:28:58,779 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a20441b/02ba69bb27b741e9aefe98f945a010be/FLAG38afe146b [2025-03-03 20:28:58,956 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:28:58,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-41.i [2025-03-03 20:28:58,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a20441b/02ba69bb27b741e9aefe98f945a010be/FLAG38afe146b [2025-03-03 20:28:58,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a20441b/02ba69bb27b741e9aefe98f945a010be [2025-03-03 20:28:58,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:28:58,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:28:58,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:58,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:28:58,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:28:58,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:58" (1/1) ... [2025-03-03 20:28:58,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f770e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:58, skipping insertion in model container [2025-03-03 20:28:58,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:58" (1/1) ... [2025-03-03 20:28:59,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:28:59,122 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-pe-ci_file-41.i[919,932] [2025-03-03 20:28:59,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:59,207 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:28:59,215 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-pe-ci_file-41.i[919,932] [2025-03-03 20:28:59,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:59,264 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:28:59,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59 WrapperNode [2025-03-03 20:28:59,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:59,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:59,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:28:59,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:28:59,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,310 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2025-03-03 20:28:59,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:59,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:28:59,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:28:59,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:28:59,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,340 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 20:28:59,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:28:59,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:28:59,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:28:59,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:28:59,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (1/1) ... [2025-03-03 20:28:59,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:59,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:59,398 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 20:28:59,401 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 20:28:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:28:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:28:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:28:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:28:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:28:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:28:59,490 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:28:59,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:29:05,869 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 20:29:05,869 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:29:05,876 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:29:05,877 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:29:05,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:29:05 BoogieIcfgContainer [2025-03-03 20:29:05,877 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:29:05,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:29:05,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:29:05,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:29:05,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:28:58" (1/3) ... [2025-03-03 20:29:05,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8cc2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:29:05, skipping insertion in model container [2025-03-03 20:29:05,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:59" (2/3) ... [2025-03-03 20:29:05,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8cc2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:29:05, skipping insertion in model container [2025-03-03 20:29:05,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:29:05" (3/3) ... [2025-03-03 20:29:05,884 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-41.i [2025-03-03 20:29:05,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:29:05,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-41.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:29:05,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:29:05,935 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;@5aca72cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:29:05,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:29:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 20:29:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 20:29:05,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:05,945 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:05,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:05,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash -724878550, now seen corresponding path program 1 times [2025-03-03 20:29:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147491905] [2025-03-03 20:29:05,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:05,958 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 20:29:05,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:05,960 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 20:29:05,962 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 20:29:06,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 20:29:06,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 20:29:06,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:06,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:06,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:29:06,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-03 20:29:06,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:29:06,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:06,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147491905] [2025-03-03 20:29:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147491905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:06,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:29:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051520726] [2025-03-03 20:29:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:06,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:29:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:06,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:29:06,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:29:06,470 INFO L87 Difference]: Start difference. First operand has 74 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 20:29:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:06,485 INFO L93 Difference]: Finished difference Result 142 states and 242 transitions. [2025-03-03 20:29:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:29:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2025-03-03 20:29:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:06,491 INFO L225 Difference]: With dead ends: 142 [2025-03-03 20:29:06,491 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 20:29:06,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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 20:29:06,495 INFO L435 NwaCegarLoop]: 108 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, 108 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 20:29:06,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:29:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 20:29:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 20:29:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 20:29:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2025-03-03 20:29:06,529 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 134 [2025-03-03 20:29:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:06,529 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2025-03-03 20:29:06,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 20:29:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2025-03-03 20:29:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 20:29:06,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:06,531 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:06,545 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 20:29:06,732 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 20:29:06,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:06,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1320251313, now seen corresponding path program 1 times [2025-03-03 20:29:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987940007] [2025-03-03 20:29:06,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:06,734 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 20:29:06,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:06,736 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 20:29:06,736 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 20:29:06,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 20:29:07,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 20:29:07,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:07,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:07,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 20:29:07,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 20:29:08,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:29:08,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:08,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987940007] [2025-03-03 20:29:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987940007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:08,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:29:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918022702] [2025-03-03 20:29:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:08,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:29:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:08,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:29:08,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:29:08,266 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 20:29:16,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:16,864 INFO L93 Difference]: Finished difference Result 206 states and 316 transitions. [2025-03-03 20:29:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:29:16,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 134 [2025-03-03 20:29:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:16,866 INFO L225 Difference]: With dead ends: 206 [2025-03-03 20:29:16,866 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 20:29:16,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 132 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 20:29:16,868 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 40 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:16,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 184 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2025-03-03 20:29:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 20:29:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-03 20:29:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 20:29:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2025-03-03 20:29:16,882 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 134 [2025-03-03 20:29:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:16,883 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2025-03-03 20:29:16,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 20:29:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2025-03-03 20:29:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 20:29:16,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:16,887 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:16,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 20:29:17,087 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 20:29:17,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:17,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2106533494, now seen corresponding path program 1 times [2025-03-03 20:29:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:17,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975516200] [2025-03-03 20:29:17,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:17,089 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 20:29:17,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:17,091 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 20:29:17,093 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 20:29:17,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 20:29:17,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 20:29:17,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:17,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:17,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:29:17,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 20:29:17,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:29:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 20:29:18,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975516200] [2025-03-03 20:29:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975516200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:29:18,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:29:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 20:29:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979742530] [2025-03-03 20:29:18,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:29:18,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:29:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:18,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:29:18,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:29:18,382 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 20:29:20,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:20,574 INFO L93 Difference]: Finished difference Result 277 states and 413 transitions. [2025-03-03 20:29:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:29:20,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 135 [2025-03-03 20:29:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:20,599 INFO L225 Difference]: With dead ends: 277 [2025-03-03 20:29:20,599 INFO L226 Difference]: Without dead ends: 145 [2025-03-03 20:29:20,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:29:20,600 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 144 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:20,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 184 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 20:29:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-03 20:29:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-03-03 20:29:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 98 states have internal predecessors, (126), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 20:29:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2025-03-03 20:29:20,611 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 135 [2025-03-03 20:29:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:20,612 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2025-03-03 20:29:20,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 20:29:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2025-03-03 20:29:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 20:29:20,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:20,613 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:20,630 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 20:29:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:29:20,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:20,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1977082889, now seen corresponding path program 1 times [2025-03-03 20:29:20,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:20,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989006959] [2025-03-03 20:29:20,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:20,815 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 20:29:20,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:20,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:29:20,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 20:29:20,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 20:29:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 20:29:21,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:21,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:21,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:29:21,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 20:29:21,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:29:21,295 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989006959] [2025-03-03 20:29:21,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989006959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:21,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:21,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:29:21,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356151899] [2025-03-03 20:29:21,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:21,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:29:21,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:21,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:29:21,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:29:21,297 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 20:29:22,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 20:29:27,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 20:29:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:29,819 INFO L93 Difference]: Finished difference Result 283 states and 408 transitions. [2025-03-03 20:29:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:29:29,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2025-03-03 20:29:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:29,823 INFO L225 Difference]: With dead ends: 283 [2025-03-03 20:29:29,823 INFO L226 Difference]: Without dead ends: 212 [2025-03-03 20:29:29,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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 20:29:29,824 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 87 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:29,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 278 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-03-03 20:29:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-03 20:29:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2025-03-03 20:29:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 145 states have (on average 1.289655172413793) internal successors, (187), 145 states have internal predecessors, (187), 57 states have call successors, (57), 6 states have call predecessors, (57), 6 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 20:29:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 301 transitions. [2025-03-03 20:29:29,857 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 301 transitions. Word has length 135 [2025-03-03 20:29:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:29,858 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 301 transitions. [2025-03-03 20:29:29,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 20:29:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 301 transitions. [2025-03-03 20:29:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 20:29:29,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:29,861 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:29,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 20:29:30,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:29:30,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:30,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1473412536, now seen corresponding path program 1 times [2025-03-03 20:29:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:30,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174111289] [2025-03-03 20:29:30,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:30,063 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 20:29:30,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:30,065 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 20:29:30,066 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 20:29:30,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 20:29:30,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 20:29:30,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:30,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:30,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:29:30,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 24 proven. 360 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 20:29:32,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:29:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 20:29:32,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174111289] [2025-03-03 20:29:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174111289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:29:32,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:29:32,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-03 20:29:32,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010242754] [2025-03-03 20:29:32,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:29:32,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:29:32,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:32,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:29:32,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:29:32,652 INFO L87 Difference]: Start difference. First operand 209 states and 301 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-03 20:29:38,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:40,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:29:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:40,589 INFO L93 Difference]: Finished difference Result 433 states and 614 transitions. [2025-03-03 20:29:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:29:40,611 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 135 [2025-03-03 20:29:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:40,613 INFO L225 Difference]: With dead ends: 433 [2025-03-03 20:29:40,613 INFO L226 Difference]: Without dead ends: 227 [2025-03-03 20:29:40,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:29:40,614 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 256 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:40,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 147 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-03-03 20:29:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-03 20:29:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2025-03-03 20:29:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 154 states have (on average 1.2467532467532467) internal successors, (192), 154 states have internal predecessors, (192), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 20:29:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2025-03-03 20:29:40,629 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 135 [2025-03-03 20:29:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:40,629 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2025-03-03 20:29:40,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-03 20:29:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2025-03-03 20:29:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 20:29:40,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:40,633 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:40,648 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 20:29:40,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:29:40,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:40,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1207614192, now seen corresponding path program 1 times [2025-03-03 20:29:40,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:40,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888341820] [2025-03-03 20:29:40,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:40,834 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 20:29:40,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:40,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:29:40,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-03 20:29:40,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 20:29:41,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 20:29:41,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:41,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:41,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 20:29:41,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 357 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-03 20:29:41,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:29:42,971 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:29:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888341820] [2025-03-03 20:29:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888341820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:29:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [811586812] [2025-03-03 20:29:42,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:42,972 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 20:29:42,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 20:29:42,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 20:29:42,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-03 20:29:43,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 20:29:44,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 20:29:44,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:44,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:44,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 20:29:44,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 357 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-03 20:29:44,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:29:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [811586812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:29:45,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:29:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-03 20:29:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097714591] [2025-03-03 20:29:45,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:29:45,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:29:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:29:45,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:29:45,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:29:45,493 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 20:29:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:47,932 INFO L93 Difference]: Finished difference Result 469 states and 633 transitions. [2025-03-03 20:29:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:29:47,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 135 [2025-03-03 20:29:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:47,958 INFO L225 Difference]: With dead ends: 469 [2025-03-03 20:29:47,958 INFO L226 Difference]: Without dead ends: 251 [2025-03-03 20:29:47,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:29:47,959 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 95 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:47,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 288 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 20:29:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-03 20:29:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2025-03-03 20:29:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 172 states have (on average 1.2034883720930232) internal successors, (207), 172 states have internal predecessors, (207), 57 states have call successors, (57), 15 states have call predecessors, (57), 15 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 20:29:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 321 transitions. [2025-03-03 20:29:47,976 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 321 transitions. Word has length 135 [2025-03-03 20:29:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:47,977 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 321 transitions. [2025-03-03 20:29:47,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 20:29:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 321 transitions. [2025-03-03 20:29:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 20:29:47,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:47,978 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:47,992 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 (7)] Ended with exit code 0 [2025-03-03 20:29:48,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-03 20:29:48,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 20:29:48,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:48,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash 99056560, now seen corresponding path program 1 times [2025-03-03 20:29:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:29:48,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061223983] [2025-03-03 20:29:48,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:48,380 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 20:29:48,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:29:48,382 INFO L229 MonitoredProcess]: Starting monitored process 9 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 20:29:48,382 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 (9)] Waiting until timeout for monitored process [2025-03-03 20:29:48,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 20:29:48,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 20:29:48,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:48,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:48,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 20:29:48,852 INFO L279 TraceCheckSpWp]: Computing forward predicates...