./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_codestructure_functionizing_file-0.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 e7999cbc02495ec6922b91474a62a692fbfb55ed13055ddc827dcb10c95c728f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:02:54,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:02:54,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:02:54,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:02:54,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:02:54,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:02:54,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:02:54,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:02:54,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:02:54,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:02:54,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:02:54,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:02:54,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:02:54,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:02:54,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:02:54,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:02:54,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:02:54,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:02:54,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:02:54,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:02:54,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:02:54,362 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 -> e7999cbc02495ec6922b91474a62a692fbfb55ed13055ddc827dcb10c95c728f [2025-03-16 23:02:54,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:02:54,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:02:54,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:02:54,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:02:54,597 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:02:54,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i [2025-03-16 23:02:55,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07a9f22/731c8bb2fe064358913878f30d221a62/FLAG2e842041b [2025-03-16 23:02:55,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:02:55,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i [2025-03-16 23:02:56,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07a9f22/731c8bb2fe064358913878f30d221a62/FLAG2e842041b [2025-03-16 23:02:56,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07a9f22/731c8bb2fe064358913878f30d221a62 [2025-03-16 23:02:56,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:02:56,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:02:56,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:02:56,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:02:56,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:02:56,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d018ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56, skipping insertion in model container [2025-03-16 23:02:56,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:02:56,152 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_codestructure_functionizing_file-0.i[919,932] [2025-03-16 23:02:56,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:02:56,220 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:02:56,229 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_codestructure_functionizing_file-0.i[919,932] [2025-03-16 23:02:56,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:02:56,280 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:02:56,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56 WrapperNode [2025-03-16 23:02:56,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:02:56,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:02:56,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:02:56,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:02:56,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,319 INFO L138 Inliner]: procedures = 33, calls = 40, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 168 [2025-03-16 23:02:56,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:02:56,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:02:56,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:02:56,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:02:56,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,340 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:02:56,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:02:56,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:02:56,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:02:56,355 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:02:56,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (1/1) ... [2025-03-16 23:02:56,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:02:56,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:02:56,387 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-16 23:02:56,391 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-16 23:02:56,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:02:56,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:02:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:02:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:02:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:02:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:02:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure functionized1 [2025-03-16 23:02:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized1 [2025-03-16 23:02:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure functionized0 [2025-03-16 23:02:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized0 [2025-03-16 23:02:56,483 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:02:56,484 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:02:56,803 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-16 23:02:56,807 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:02:56,818 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:02:56,818 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:02:56,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:02:56 BoogieIcfgContainer [2025-03-16 23:02:56,819 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:02:56,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:02:56,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:02:56,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:02:56,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:02:56" (1/3) ... [2025-03-16 23:02:56,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bcad41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:02:56, skipping insertion in model container [2025-03-16 23:02:56,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:02:56" (2/3) ... [2025-03-16 23:02:56,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bcad41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:02:56, skipping insertion in model container [2025-03-16 23:02:56,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:02:56" (3/3) ... [2025-03-16 23:02:56,830 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-0.i [2025-03-16 23:02:56,842 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:02:56,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_functionizing_file-0.i that has 4 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:02:56,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:02:56,902 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;@6635f624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:02:56,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:02:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:02:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 23:02:56,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:56,916 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:02:56,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:56,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash -129951169, now seen corresponding path program 1 times [2025-03-16 23:02:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:56,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877526185] [2025-03-16 23:02:56,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:56,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 23:02:57,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 23:02:57,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:57,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 23:02:57,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:57,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877526185] [2025-03-16 23:02:57,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877526185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:02:57,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472298705] [2025-03-16 23:02:57,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:57,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:02:57,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:02:57,135 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-16 23:02:57,137 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-16 23:02:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 23:02:57,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 23:02:57,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:57,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:57,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:02:57,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:02:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 23:02:57,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:02:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472298705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:57,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:02:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:02:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423497069] [2025-03-16 23:02:57,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:57,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:02:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:57,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:02:57,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:02:57,357 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (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-16 23:02:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:57,381 INFO L93 Difference]: Finished difference Result 145 states and 228 transitions. [2025-03-16 23:02:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:02:57,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (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 125 [2025-03-16 23:02:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:57,388 INFO L225 Difference]: With dead ends: 145 [2025-03-16 23:02:57,389 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 23:02:57,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-16 23:02:57,394 INFO L435 NwaCegarLoop]: 102 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, 102 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-16 23:02:57,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:02:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 23:02:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-16 23:02:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:02:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2025-03-16 23:02:57,446 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 125 [2025-03-16 23:02:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:57,446 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2025-03-16 23:02:57,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (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-16 23:02:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2025-03-16 23:02:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 23:02:57,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:57,450 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:02:57,456 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-16 23:02:57,650 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-16 23:02:57,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:57,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1695327745, now seen corresponding path program 1 times [2025-03-16 23:02:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:57,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547537801] [2025-03-16 23:02:57,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:57,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:57,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 23:02:57,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 23:02:57,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:57,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:02:57,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:02:57,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 23:02:58,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 23:02:58,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:58,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:02:58,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:02:58,213 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:02:58,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:02:58,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:02:58,217 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-16 23:02:58,276 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:02:58,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:02:58 BoogieIcfgContainer [2025-03-16 23:02:58,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:02:58,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:02:58,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:02:58,281 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:02:58,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:02:56" (3/4) ... [2025-03-16 23:02:58,283 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:02:58,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:02:58,285 INFO L158 Benchmark]: Toolchain (without parser) took 2267.23ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 119.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2025-03-16 23:02:58,285 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:02:58,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.07ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 116.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:02:58,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.77ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 114.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:02:58,286 INFO L158 Benchmark]: Boogie Preprocessor took 33.71ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 110.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:02:58,287 INFO L158 Benchmark]: IcfgBuilder took 464.47ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 87.9MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:02:58,287 INFO L158 Benchmark]: TraceAbstraction took 1457.59ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 119.4MB in the end (delta: -31.4MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-03-16 23:02:58,287 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 119.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:02:58,288 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.21ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.07ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 116.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.77ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 114.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.71ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 110.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 464.47ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 87.9MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1457.59ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 119.4MB in the end (delta: -31.4MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 119.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 68. Possible FailurePath: [L28] unsigned char isInitial = 0; [L29] signed long int var_1_1 = 0; [L30] unsigned char var_1_2 = 0; [L31] unsigned char var_1_3 = 32; [L32] signed long int var_1_4 = -32; [L33] signed long int var_1_5 = 2; [L34] signed short int var_1_6 = -10; [L35] unsigned long int var_1_7 = 1; [L36] unsigned char var_1_8 = 0; [L37] unsigned long int var_1_9 = 3470417420; [L38] unsigned char var_1_10 = 0; [L39] double var_1_11 = 32.875; [L40] double var_1_12 = 25.6; [L41] double var_1_13 = 1.75; [L42] float var_1_14 = 5.4; [L43] float var_1_15 = 127.5; [L44] float var_1_16 = 3.5; [L45] signed long int var_1_17 = 64; [L46] unsigned char var_1_18 = 64; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] FCALL updateLastVariables() [L149] CALL updateVariables() [L108] var_1_2 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L109] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L110] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L110] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L111] var_1_3 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L112] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L113] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L113] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L114] var_1_4 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L115] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L116] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L116] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L117] var_1_9 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L118] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L119] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L119] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L120] var_1_10 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L121] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L122] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L122] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L123] var_1_11 = __VERIFIER_nondet_double() [L124] 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, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L124] 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, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L125] var_1_12 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L126] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L127] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L127] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L128] var_1_13 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L129] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L130] var_1_15 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L131] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L132] var_1_16 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L133] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L134] var_1_18 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L135] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L136] CALL assume_abort_if_not(var_1_18 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L136] RET assume_abort_if_not(var_1_18 <= 255) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L149] RET updateVariables() [L150] CALL step() [L77] COND TRUE var_1_2 > (- var_1_3) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L78] CALL, EXPR functionized0(var_1_4) VAL [\old(functionized0_localFunctionVar0)=-6, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L48] return (var_1_2 + functionized0_localFunctionVar0); VAL [\old(functionized0_localFunctionVar0)=-6, \result=-4, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L78] RET, EXPR functionized0(var_1_4) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L78] EXPR ((var_1_3) > (functionized0(var_1_4))) ? (var_1_3) : (functionized0(var_1_4)) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L78] var_1_1 = ((((var_1_3) > (functionized0(var_1_4))) ? (var_1_3) : (functionized0(var_1_4)))) [L82] CALL functionized2(var_1_4, var_1_3) [L54] COND TRUE functionized2_localFunctionVar1 < var_1_2 [L55] var_1_5 = ((var_1_2 - functionized2_localFunctionVar1) + functionized2_localFunctionVar0) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=-4, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L82] RET functionized2(var_1_4, var_1_3) [L83] CALL, EXPR functionized3(var_1_5) [L59] return (- functionized3_localFunctionVar0); [L83] RET, EXPR functionized3(var_1_5) [L83] COND TRUE var_1_2 < functionized3(var_1_5) [L84] CALL, EXPR functionized4(var_1_3) [L62] return (32 - functionized4_localFunctionVar0); [L84] RET, EXPR functionized4(var_1_3) [L84] var_1_6 = functionized4(var_1_3) [L86] COND FALSE !(var_1_1 > var_1_3) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=-4, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=-4294967301] [L91] CALL functionized5(var_1_11, var_1_2, var_1_13) [L65] COND FALSE !((- 8u) >= (var_1_9 - functionized5_localFunctionVar1)) [L68] var_1_8 = (((functionized5_localFunctionVar0 / var_1_12) >= functionized5_localFunctionVar2) || var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=-4, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=-4294967301] [L91] RET functionized5(var_1_11, var_1_2, var_1_13) [L92] COND FALSE !((var_1_12 * var_1_11) > var_1_13) [L99] var_1_14 = var_1_16 VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=64, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=-4, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=-4294967301] [L101] CALL, EXPR functionized6(var_1_13) [L72] return ((((functionized6_localFunctionVar0) < (var_1_16)) ? (functionized6_localFunctionVar0) : (var_1_16))); [L101] RET, EXPR functionized6(var_1_13) [L101] COND TRUE ((var_1_11 + var_1_14) / 9.2) < functionized6(var_1_13) [L102] var_1_17 = ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))) VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=2, var_1_18=1, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=-4, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=-4294967301] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return (((((((var_1_2 > (- var_1_3)) ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_2 + var_1_4))) ? (var_1_3) : ((var_1_2 + var_1_4)))))) : (var_1_1 == ((signed long int) (((((1 - var_1_2)) < (16)) ? ((1 - var_1_2)) : (16)))))) && ((var_1_3 < var_1_2) ? (var_1_5 == ((signed long int) ((var_1_2 - var_1_3) + var_1_4))) : 1)) && ((var_1_2 < (- var_1_5)) ? (var_1_6 == ((signed short int) (32 - var_1_3))) : 1)) && ((var_1_1 > var_1_3) ? ((var_1_4 <= var_1_6) ? (var_1_7 == ((unsigned long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_2)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_11 / var_1_12) >= var_1_13) || var_1_10))))) && (((var_1_12 * var_1_11) > var_1_13) ? ((var_1_9 < var_1_5) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((var_1_11 + var_1_14) / 9.2) < ((((var_1_13) < (var_1_16)) ? (var_1_13) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))))) : (var_1_17 == ((signed long int) var_1_4))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=2, var_1_18=1, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=-4, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=-4294967301] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=3470417426, var_1_13=3470417425, var_1_14=3470417425, var_1_16=3470417425, var_1_17=2, var_1_18=1, var_1_1=0, var_1_2=-33022, var_1_3=0, var_1_4=-6, var_1_5=-4, var_1_6=32, var_1_7=1, var_1_8=1, var_1_9=-4294967301] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 128 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 102 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 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-16 23:02:58,304 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_codestructure_functionizing_file-0.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 e7999cbc02495ec6922b91474a62a692fbfb55ed13055ddc827dcb10c95c728f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:03:00,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:03:00,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:03:00,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:03:00,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:03:00,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:03:00,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:03:00,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:03:00,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:03:00,259 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:03:00,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:03:00,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:03:00,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:03:00,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:03:00,260 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:03:00,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:03:00,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:03:00,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:03:00,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:03:00,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:03:00,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:03:00,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:03:00,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:03:00,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:03:00,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:03:00,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:03:00,264 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 -> e7999cbc02495ec6922b91474a62a692fbfb55ed13055ddc827dcb10c95c728f [2025-03-16 23:03:00,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:03:00,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:03:00,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:03:00,505 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:03:00,506 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:03:00,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i [2025-03-16 23:03:01,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9461e210/4d7f6f7f494a4db79e0b49b4b2da7a24/FLAG7d9c8fcf4 [2025-03-16 23:03:01,904 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:03:01,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-0.i [2025-03-16 23:03:01,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9461e210/4d7f6f7f494a4db79e0b49b4b2da7a24/FLAG7d9c8fcf4 [2025-03-16 23:03:02,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9461e210/4d7f6f7f494a4db79e0b49b4b2da7a24 [2025-03-16 23:03:02,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:03:02,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:03:02,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:03:02,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:03:02,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:03:02,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fe794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02, skipping insertion in model container [2025-03-16 23:03:02,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:03:02,378 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_codestructure_functionizing_file-0.i[919,932] [2025-03-16 23:03:02,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:03:02,434 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:03:02,443 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_codestructure_functionizing_file-0.i[919,932] [2025-03-16 23:03:02,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:03:02,474 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:03:02,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02 WrapperNode [2025-03-16 23:03:02,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:03:02,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:03:02,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:03:02,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:03:02,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,509 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 161 [2025-03-16 23:03:02,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:03:02,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:03:02,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:03:02,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:03:02,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,528 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-16 23:03:02,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:03:02,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:03:02,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:03:02,552 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:03:02,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (1/1) ... [2025-03-16 23:03:02,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:03:02,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:03:02,587 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-16 23:03:02,594 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-16 23:03:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:03:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:03:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:03:02,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:03:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:03:02,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:03:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure functionized1 [2025-03-16 23:03:02,612 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized1 [2025-03-16 23:03:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure functionized0 [2025-03-16 23:03:02,612 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized0 [2025-03-16 23:03:02,696 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:03:02,698 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:03:26,851 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-16 23:03:26,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:03:26,858 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:03:26,859 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:03:26,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:03:26 BoogieIcfgContainer [2025-03-16 23:03:26,859 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:03:26,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:03:26,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:03:26,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:03:26,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:03:02" (1/3) ... [2025-03-16 23:03:26,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4bbc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:03:26, skipping insertion in model container [2025-03-16 23:03:26,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:02" (2/3) ... [2025-03-16 23:03:26,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4bbc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:03:26, skipping insertion in model container [2025-03-16 23:03:26,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:03:26" (3/3) ... [2025-03-16 23:03:26,866 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-0.i [2025-03-16 23:03:26,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:03:26,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_functionizing_file-0.i that has 4 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:03:26,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:03:26,919 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;@1ee55900, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:03:26,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:03:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:03:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 23:03:26,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:03:26,930 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:03:26,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:03:26,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:03:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1129486466, now seen corresponding path program 1 times [2025-03-16 23:03:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:03:26,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451489809] [2025-03-16 23:03:26,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:03:26,942 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-16 23:03:26,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:03:26,944 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-16 23:03:26,945 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-16 23:03:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 23:03:29,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 23:03:29,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:03:29,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:03:29,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:03:29,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:03:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-16 23:03:29,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:03:29,144 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:03:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451489809] [2025-03-16 23:03:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451489809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:03:29,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:03:29,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:03:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022031601] [2025-03-16 23:03:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:03:29,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:03:29,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:03:29,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:03:29,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:03:29,162 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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-16 23:03:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:03:29,178 INFO L93 Difference]: Finished difference Result 141 states and 224 transitions. [2025-03-16 23:03:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:03:29,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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 124 [2025-03-16 23:03:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:03:29,183 INFO L225 Difference]: With dead ends: 141 [2025-03-16 23:03:29,184 INFO L226 Difference]: Without dead ends: 70 [2025-03-16 23:03:29,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-16 23:03:29,188 INFO L435 NwaCegarLoop]: 100 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, 100 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-16 23:03:29,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:03:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-16 23:03:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-16 23:03:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:03:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2025-03-16 23:03:29,222 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 124 [2025-03-16 23:03:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:03:29,223 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2025-03-16 23:03:29,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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-16 23:03:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2025-03-16 23:03:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 23:03:29,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:03:29,226 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:03:29,278 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 (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:03:29,426 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-16 23:03:29,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:03:29,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:03:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1998222208, now seen corresponding path program 1 times [2025-03-16 23:03:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:03:29,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840014764] [2025-03-16 23:03:29,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:03:29,428 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-16 23:03:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:03:29,431 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-16 23:03:29,432 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-16 23:03:29,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 23:03:32,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 23:03:32,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:03:32,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:03:32,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-16 23:03:32,803 INFO L279 TraceCheckSpWp]: Computing forward predicates...