./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-2.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 00dccbc1f84e1a10e96e4bb25c4226d582aabc584f46ae4ceb048818681b4533 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:37:20,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:37:21,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:37:21,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:37:21,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:37:21,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:37:21,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:37:21,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:37:21,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:37:21,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:37:21,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:37:21,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:37:21,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:37:21,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:37:21,034 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:37:21,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:37:21,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:37:21,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:37:21,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:37:21,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:37:21,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:37:21,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:37:21,039 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 -> 00dccbc1f84e1a10e96e4bb25c4226d582aabc584f46ae4ceb048818681b4533 [2025-03-08 11:37:21,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:37:21,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:37:21,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:37:21,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:37:21,272 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:37:21,273 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-2.i [2025-03-08 11:37:22,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361c23a70/e79ee2d1c509453b950e676414f8e592/FLAG115e400f9 [2025-03-08 11:37:22,741 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:37:22,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-2.i [2025-03-08 11:37:22,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361c23a70/e79ee2d1c509453b950e676414f8e592/FLAG115e400f9 [2025-03-08 11:37:22,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361c23a70/e79ee2d1c509453b950e676414f8e592 [2025-03-08 11:37:22,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:37:22,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:37:22,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:37:22,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:37:22,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:37:22,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:37:22" (1/1) ... [2025-03-08 11:37:22,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:22, skipping insertion in model container [2025-03-08 11:37:22,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:37:22" (1/1) ... [2025-03-08 11:37:22,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:37:22,902 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-2.i[918,931] [2025-03-08 11:37:22,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:37:22,955 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:37:22,962 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-2.i[918,931] [2025-03-08 11:37:22,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:37:23,005 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:37:23,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23 WrapperNode [2025-03-08 11:37:23,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:37:23,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:37:23,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:37:23,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:37:23,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,050 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-08 11:37:23,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:37:23,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:37:23,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:37:23,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:37:23,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,081 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:37:23,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:37:23,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:37:23,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:37:23,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:37:23,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (1/1) ... [2025-03-08 11:37:23,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:37:23,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:37:23,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:37:23,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:37:23,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:37:23,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:37:23,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:37:23,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:37:23,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:37:23,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:37:23,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:37:23,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:37:23,463 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 11:37:23,463 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:37:23,479 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:37:23,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:37:23,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:37:23 BoogieIcfgContainer [2025-03-08 11:37:23,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:37:23,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:37:23,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:37:23,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:37:23,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:37:22" (1/3) ... [2025-03-08 11:37:23,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5e5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:37:23, skipping insertion in model container [2025-03-08 11:37:23,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:23" (2/3) ... [2025-03-08 11:37:23,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5e5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:37:23, skipping insertion in model container [2025-03-08 11:37:23,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:37:23" (3/3) ... [2025-03-08 11:37:23,486 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-2.i [2025-03-08 11:37:23,496 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:37:23,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-2.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:37:23,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:37:23,544 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;@281f4561, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:37:23,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:37:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 57 states have internal predecessors, (85), 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-08 11:37:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 11:37:23,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:23,556 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] [2025-03-08 11:37:23,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:23,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1979419903, now seen corresponding path program 1 times [2025-03-08 11:37:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:37:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860809661] [2025-03-08 11:37:23,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:37:23,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 11:37:23,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 11:37:23,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:23,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:23,799 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-08 11:37:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:37:23,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860809661] [2025-03-08 11:37:23,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860809661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:37:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095355847] [2025-03-08 11:37:23,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:23,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:37:23,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:37:23,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:37:23,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:37:23,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 11:37:23,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 11:37:23,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:23,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:23,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:37:23,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:37:23,990 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-08 11:37:23,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:37:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095355847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:37:23,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:37:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:37:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115672307] [2025-03-08 11:37:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:37:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:37:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:37:24,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:37:24,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:37:24,009 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 57 states have internal predecessors, (85), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-08 11:37:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:37:24,032 INFO L93 Difference]: Finished difference Result 150 states and 260 transitions. [2025-03-08 11:37:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:37:24,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 132 [2025-03-08 11:37:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:37:24,038 INFO L225 Difference]: With dead ends: 150 [2025-03-08 11:37:24,038 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 11:37:24,040 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-08 11:37:24,042 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:37:24,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:37:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 11:37:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-08 11:37:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 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-08 11:37:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2025-03-08 11:37:24,068 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 132 [2025-03-08 11:37:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:37:24,069 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2025-03-08 11:37:24,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-08 11:37:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2025-03-08 11:37:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 11:37:24,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:24,071 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] [2025-03-08 11:37:24,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:37:24,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:37:24,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:24,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash -775411702, now seen corresponding path program 1 times [2025-03-08 11:37:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:37:24,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-03-08 11:37:24,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:24,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:37:24,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 11:37:24,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 11:37:24,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:24,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:37:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035895759] [2025-03-08 11:37:24,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:24,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:37:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:37:24,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:37:24,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:37:24,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 11:37:24,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 11:37:24,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:24,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:24,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 11:37:24,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:37:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 369 proven. 27 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 11:37:24,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:37:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 11:37:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:37:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-03-08 11:37:26,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:37:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035895759] [2025-03-08 11:37:26,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035895759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:37:26,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:37:26,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2025-03-08 11:37:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224504084] [2025-03-08 11:37:26,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:37:26,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:37:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:37:26,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:37:26,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:37:26,052 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-08 11:37:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:37:26,918 INFO L93 Difference]: Finished difference Result 223 states and 333 transitions. [2025-03-08 11:37:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 11:37:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 133 [2025-03-08 11:37:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:37:26,921 INFO L225 Difference]: With dead ends: 223 [2025-03-08 11:37:26,921 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 11:37:26,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2025-03-08 11:37:26,922 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 356 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:37:26,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 418 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:37:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 11:37:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 96. [2025-03-08 11:37:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 73 states have internal predecessors, (107), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 11:37:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2025-03-08 11:37:26,943 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 133 [2025-03-08 11:37:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:37:26,944 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2025-03-08 11:37:26,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-08 11:37:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2025-03-08 11:37:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 11:37:26,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:26,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-08 11:37:26,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:37:27,150 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-08 11:37:27,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash 758323774, now seen corresponding path program 1 times [2025-03-08 11:37:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:37:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445842457] [2025-03-08 11:37:27,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:37:27,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 11:37:27,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 11:37:27,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:27,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:37:27,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230212157] [2025-03-08 11:37:27,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:27,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:37:27,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:37:27,277 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-08 11:37:27,278 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-08 11:37:27,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 11:37:27,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 11:37:27,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:27,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:37:27,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:37:27,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 11:37:27,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 11:37:27,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:27,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:37:27,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:37:27,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:37:27,507 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:37:27,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:37:27,709 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-08 11:37:27,712 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 11:37:27,803 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:37:27,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:37:27 BoogieIcfgContainer [2025-03-08 11:37:27,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:37:27,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:37:27,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:37:27,809 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:37:27,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:37:23" (3/4) ... [2025-03-08 11:37:27,812 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:37:27,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:37:27,813 INFO L158 Benchmark]: Toolchain (without parser) took 5045.15ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 88.6MB in the end (delta: 24.5MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2025-03-08 11:37:27,813 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:37:27,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.36ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:37:27,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.59ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:37:27,814 INFO L158 Benchmark]: Boogie Preprocessor took 58.61ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:37:27,815 INFO L158 Benchmark]: IcfgBuilder took 369.46ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 69.1MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 11:37:27,815 INFO L158 Benchmark]: TraceAbstraction took 4326.63ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 88.6MB in the end (delta: -20.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:37:27,815 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 88.6MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:37:27,816 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.36ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.59ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.61ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 369.46ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 69.1MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4326.63ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 88.6MB in the end (delta: -20.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 88.6MB 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 someBinaryArithmeticDOUBLEoperation at line 118, overapproximation of someBinaryArithmeticDOUBLEoperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someUnaryDOUBLEoperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryArithmeticFLOAToperation at line 99, overapproximation of someBinaryArithmeticFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] float var_1_22 = 256.5; [L40] signed char var_1_27 = -64; [L41] signed char var_1_30 = -10; [L42] unsigned long int var_1_31 = 8; [L43] double var_1_32 = 499.75; [L44] double var_1_36 = 3.15; [L45] unsigned char var_1_38 = 8; [L46] float var_1_40 = 255.8; [L47] signed short int var_1_41 = 256; [L48] signed char var_1_42 = -32; [L49] unsigned long int last_1_var_1_6 = 10000; VAL [isInitial=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L134] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L136] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L137] var_1_8 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L138] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L139] var_1_11 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L140] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L142] var_1_12 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L143] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L144] var_1_13 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L145] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L146] var_1_15 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L147] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L150] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L152] var_1_18 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L153] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L155] var_1_30 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L156] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L158] var_1_36 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L159] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L160] var_1_42 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_42 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L161] RET assume_abort_if_not(var_1_42 >= -128) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L162] CALL assume_abort_if_not(var_1_42 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L162] RET assume_abort_if_not(var_1_42 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L163] CALL assume_abort_if_not(var_1_42 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L163] RET assume_abort_if_not(var_1_42 != 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L177] RET updateVariables() [L178] CALL step() [L53] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L54] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L56] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L57] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L61] var_1_20 = var_1_16 [L62] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L63] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L64] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L65] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L72] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L73] COND FALSE !(\read(var_1_17)) [L84] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=5] [L86] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=5, var_1_21=5, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=5] [L87] COND FALSE !(var_1_6 > var_1_6) [L90] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=4, var_1_20=5, var_1_21=5, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L95] COND TRUE var_1_1 < var_1_11 [L96] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L98] COND TRUE var_1_6 >= var_1_16 [L99] var_1_22 = (var_1_13 + var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L101] COND FALSE !(((var_1_4 + 127.75f) * var_1_13) < var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L106] COND FALSE !(var_1_20 < (~ var_1_30)) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L111] COND FALSE !(var_1_13 == var_1_13) [L118] var_1_32 = (((((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) < 0 ) ? -((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) : ((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))))) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=5, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L120] COND TRUE ! (var_1_4 <= var_1_36) [L121] var_1_38 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=5, var_1_38=5, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L123] EXPR (var_1_16 >> 4) & var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=5, var_1_38=5, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L123] COND TRUE 128 != ((var_1_16 >> 4) & var_1_16) [L124] var_1_40 = ((((var_1_36) > (var_1_4)) ? (var_1_36) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=5, var_1_36=6, var_1_38=5, var_1_40=6, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L126] COND TRUE (var_1_16 / var_1_42) < var_1_20 [L127] var_1_41 = ((((((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))) < 0 ) ? -(((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))) : (((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))))) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=5, var_1_36=6, var_1_38=5, var_1_40=6, var_1_41=5, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=5, var_1_36=6, var_1_38=5, var_1_40=6, var_1_41=5, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=5, var_1_36=6, var_1_38=5, var_1_40=6, var_1_41=5, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=5, var_1_17=0, var_1_18=0, var_1_1=4, var_1_20=5, var_1_21=5, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=5, var_1_36=6, var_1_38=5, var_1_40=6, var_1_41=5, var_1_42=2, var_1_4=0, var_1_5=4, var_1_6=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 142 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 532 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 237 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 20, 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, 55 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 1309 SizeOfPredicates, 1 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2646/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 11:37:27,834 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-2.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 00dccbc1f84e1a10e96e4bb25c4226d582aabc584f46ae4ceb048818681b4533 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:37:29,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:37:29,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:37:29,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:37:29,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:37:29,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:37:29,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:37:29,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:37:29,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:37:29,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:37:29,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:37:29,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:37:29,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:37:29,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:37:29,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:37:29,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:37:29,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:37:29,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:37:29,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:37:29,753 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 -> 00dccbc1f84e1a10e96e4bb25c4226d582aabc584f46ae4ceb048818681b4533 [2025-03-08 11:37:29,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:37:29,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:37:29,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:37:29,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:37:29,998 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:37:29,999 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-2.i [2025-03-08 11:37:31,181 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc161cd0d/2558203656d54c11a9d7cb404afa4dc6/FLAG57b3a8270 [2025-03-08 11:37:31,414 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:37:31,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-2.i [2025-03-08 11:37:31,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc161cd0d/2558203656d54c11a9d7cb404afa4dc6/FLAG57b3a8270 [2025-03-08 11:37:31,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc161cd0d/2558203656d54c11a9d7cb404afa4dc6 [2025-03-08 11:37:31,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:37:31,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:37:31,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:37:31,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:37:31,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:37:31,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:31,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b88d5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31, skipping insertion in model container [2025-03-08 11:37:31,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:31,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:37:31,867 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-2.i[918,931] [2025-03-08 11:37:31,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:37:31,931 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:37:31,938 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-2.i[918,931] [2025-03-08 11:37:31,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:37:31,969 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:37:31,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31 WrapperNode [2025-03-08 11:37:31,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:37:31,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:37:31,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:37:31,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:37:31,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:31,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,020 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-08 11:37:32,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:37:32,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:37:32,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:37:32,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:37:32,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,054 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:37:32,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:37:32,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:37:32,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:37:32,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:37:32,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (1/1) ... [2025-03-08 11:37:32,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:37:32,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:37:32,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:37:32,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:37:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:37:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:37:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:37:32,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:37:32,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:37:32,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:37:32,180 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:37:32,182 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:37:51,656 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 11:37:51,656 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:37:51,663 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:37:51,663 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:37:51,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:37:51 BoogieIcfgContainer [2025-03-08 11:37:51,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:37:51,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:37:51,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:37:51,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:37:51,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:37:31" (1/3) ... [2025-03-08 11:37:51,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f661d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:37:51, skipping insertion in model container [2025-03-08 11:37:51,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:37:31" (2/3) ... [2025-03-08 11:37:51,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f661d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:37:51, skipping insertion in model container [2025-03-08 11:37:51,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:37:51" (3/3) ... [2025-03-08 11:37:51,671 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-2.i [2025-03-08 11:37:51,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:37:51,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-2.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:37:51,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:37:51,724 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;@3a3c3705, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:37:51,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:37:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 50 states have (on average 1.5) internal successors, (75), 51 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-08 11:37:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 11:37:51,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:51,738 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] [2025-03-08 11:37:51,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:51,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash -763001345, now seen corresponding path program 1 times [2025-03-08 11:37:51,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:37:51,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649561178] [2025-03-08 11:37:51,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:51,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:37:51,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:37:51,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:37:51,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 11:37:51,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 11:37:52,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 11:37:52,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:52,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:52,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:37:52,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:37:52,575 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-08 11:37:52,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:37:52,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:37:52,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649561178] [2025-03-08 11:37:52,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649561178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:37:52,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:37:52,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:37:52,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36484449] [2025-03-08 11:37:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:37:52,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:37:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:37:52,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:37:52,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:37:52,602 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.5) internal successors, (75), 51 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) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-08 11:37:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:37:52,623 INFO L93 Difference]: Finished difference Result 138 states and 240 transitions. [2025-03-08 11:37:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:37:52,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 131 [2025-03-08 11:37:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:37:52,630 INFO L225 Difference]: With dead ends: 138 [2025-03-08 11:37:52,630 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 11:37:52,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:37:52,634 INFO L435 NwaCegarLoop]: 104 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, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:37:52,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:37:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 11:37:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 11:37:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 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-08 11:37:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-08 11:37:52,667 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 131 [2025-03-08 11:37:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:37:52,667 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-08 11:37:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-08 11:37:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-08 11:37:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 11:37:52,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:37:52,669 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] [2025-03-08 11:37:52,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:37:52,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:37:52,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:37:52,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:37:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1625794718, now seen corresponding path program 1 times [2025-03-08 11:37:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:37:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735089965] [2025-03-08 11:37:52,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:37:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:37:52,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:37:52,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:37:52,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 11:37:52,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 11:37:53,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 11:37:53,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:37:53,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:37:53,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:37:53,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:37:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 11:37:54,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:37:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 11:37:55,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:37:55,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735089965] [2025-03-08 11:37:55,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735089965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:37:55,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:37:55,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-08 11:37:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110192090] [2025-03-08 11:37:55,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:37:55,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:37:55,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:37:55,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:37:55,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:37:55,966 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 11:37:59,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:38:04,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:38:08,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:38:12,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:38:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:38:13,080 INFO L93 Difference]: Finished difference Result 165 states and 242 transitions. [2025-03-08 11:38:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:38:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 132 [2025-03-08 11:38:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:38:13,082 INFO L225 Difference]: With dead ends: 165 [2025-03-08 11:38:13,082 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 11:38:13,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:38:13,083 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 122 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:38:13,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 229 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 295 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time] [2025-03-08 11:38:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 11:38:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2025-03-08 11:38:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 63 states have internal predecessors, (79), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:38:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-08 11:38:13,095 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 132 [2025-03-08 11:38:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:38:13,095 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-08 11:38:13,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 11:38:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-08 11:38:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 11:38:13,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:38:13,096 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] [2025-03-08 11:38:13,124 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-08 11:38:13,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:38:13,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:38:13,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:38:13,298 INFO L85 PathProgramCache]: Analyzing trace with hash -187051357, now seen corresponding path program 1 times [2025-03-08 11:38:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:38:13,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677314444] [2025-03-08 11:38:13,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:38:13,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:38:13,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:38:13,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:38:13,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 11:38:13,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 11:38:14,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 11:38:14,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:38:14,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:38:14,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 11:38:14,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:38:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 318 proven. 36 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 11:38:17,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:38:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 11:38:18,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:38:18,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677314444] [2025-03-08 11:38:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677314444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:38:18,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:38:18,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-08 11:38:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267499486] [2025-03-08 11:38:18,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:38:18,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:38:18,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:38:18,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:38:18,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:38:18,646 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-08 11:38:24,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:38:28,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:38:32,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:38:34,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:38:39,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:38:43,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:38:47,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:38:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:38:47,124 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2025-03-08 11:38:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:38:47,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 133 [2025-03-08 11:38:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:38:47,190 INFO L225 Difference]: With dead ends: 180 [2025-03-08 11:38:47,190 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 11:38:47,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:38:47,191 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 45 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:38:47,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 178 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 28.2s Time] [2025-03-08 11:38:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 11:38:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-03-08 11:38:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 11:38:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2025-03-08 11:38:47,201 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 133 [2025-03-08 11:38:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:38:47,201 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2025-03-08 11:38:47,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-08 11:38:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2025-03-08 11:38:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 11:38:47,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:38:47,203 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-08 11:38:47,231 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-08 11:38:47,403 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-08 11:38:47,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:38:47,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:38:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -478989948, now seen corresponding path program 1 times [2025-03-08 11:38:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:38:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022058043] [2025-03-08 11:38:47,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:38:47,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:38:47,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:38:47,407 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-08 11:38:47,408 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-08 11:38:47,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 11:38:48,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 11:38:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:38:48,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:38:48,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 11:38:48,376 INFO L279 TraceCheckSpWp]: Computing forward predicates...