./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-24.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 795459c0c834c16bef89c6838cfefc476fabdd03a6889939ce2891ebae8af37f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:46:34,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:46:34,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:46:34,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:46:34,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:46:34,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:46:34,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:46:34,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:46:34,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:46:34,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:46:34,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:46:34,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:46:34,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:46:34,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:46:34,429 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:46:34,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:46:34,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:46:34,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:46:34,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:46:34,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:46:34,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:46:34,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:46:34,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:46:34,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:46:34,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:34,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:46:34,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:46:34,431 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 -> 795459c0c834c16bef89c6838cfefc476fabdd03a6889939ce2891ebae8af37f [2025-03-08 09:46:34,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:46:34,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:46:34,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:46:34,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:46:34,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:46:34,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-24.i [2025-03-08 09:46:35,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcccf8e38/81af9016a9324cc8ae4822754ac16f8e/FLAG4b6af1565 [2025-03-08 09:46:36,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:46:36,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-24.i [2025-03-08 09:46:36,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcccf8e38/81af9016a9324cc8ae4822754ac16f8e/FLAG4b6af1565 [2025-03-08 09:46:36,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcccf8e38/81af9016a9324cc8ae4822754ac16f8e [2025-03-08 09:46:36,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:46:36,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:46:36,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:36,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:46:36,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:46:36,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb714dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36, skipping insertion in model container [2025-03-08 09:46:36,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:46:36,466 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_dependencies_file-24.i[919,932] [2025-03-08 09:46:36,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:36,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:46:36,524 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_dependencies_file-24.i[919,932] [2025-03-08 09:46:36,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:36,551 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:46:36,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36 WrapperNode [2025-03-08 09:46:36,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:36,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:36,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:46:36,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:46:36,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,579 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2025-03-08 09:46:36,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:36,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:46:36,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:46:36,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:46:36,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,601 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:46:36,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:46:36,609 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:46:36,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:46:36,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:46:36,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (1/1) ... [2025-03-08 09:46:36,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:36,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:36,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:46:36,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:46:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:46:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:46:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:46:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:46:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:46:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:46:36,713 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:46:36,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:46:36,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2025-03-08 09:46:36,929 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 09:46:36,929 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:46:36,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:46:36,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:46:36,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:36 BoogieIcfgContainer [2025-03-08 09:46:36,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:46:36,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:46:36,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:46:36,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:46:36,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:46:36" (1/3) ... [2025-03-08 09:46:36,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250976c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:36, skipping insertion in model container [2025-03-08 09:46:36,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:36" (2/3) ... [2025-03-08 09:46:36,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250976c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:36, skipping insertion in model container [2025-03-08 09:46:36,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:36" (3/3) ... [2025-03-08 09:46:36,952 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-24.i [2025-03-08 09:46:36,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:46:36,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-24.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:46:37,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:46:37,017 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;@6ba383c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:46:37,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:46:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 09:46:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 09:46:37,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:37,029 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:37,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:37,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:37,035 INFO L85 PathProgramCache]: Analyzing trace with hash -854743625, now seen corresponding path program 1 times [2025-03-08 09:46:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306758586] [2025-03-08 09:46:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:37,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 09:46:37,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 09:46:37,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:37,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 09:46:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306758586] [2025-03-08 09:46:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306758586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:37,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:37,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:46:37,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096721869] [2025-03-08 09:46:37,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:37,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:46:37,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:37,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:46:37,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:46:37,662 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:46:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:37,881 INFO L93 Difference]: Finished difference Result 239 states and 416 transitions. [2025-03-08 09:46:37,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:46:37,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-08 09:46:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:37,888 INFO L225 Difference]: With dead ends: 239 [2025-03-08 09:46:37,888 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 09:46:37,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:46:37,895 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 113 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:37,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 315 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:46:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 09:46:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2025-03-08 09:46:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 09:46:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 211 transitions. [2025-03-08 09:46:37,953 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 211 transitions. Word has length 130 [2025-03-08 09:46:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:37,954 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 211 transitions. [2025-03-08 09:46:37,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:46:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 211 transitions. [2025-03-08 09:46:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 09:46:37,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:37,956 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:37,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:46:37,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:37,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:37,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1470894459, now seen corresponding path program 1 times [2025-03-08 09:46:37,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:37,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041341389] [2025-03-08 09:46:37,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:37,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:37,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:46:38,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:46:38,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:38,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:46:38,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:46:38,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:46:38,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:46:38,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:46:38,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:46:38,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:46:38,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:46:38,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:46:38,265 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 09:46:38,348 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:46:38,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:46:38 BoogieIcfgContainer [2025-03-08 09:46:38,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:46:38,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:46:38,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:46:38,352 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:46:38,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:36" (3/4) ... [2025-03-08 09:46:38,354 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:46:38,355 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:46:38,356 INFO L158 Benchmark]: Toolchain (without parser) took 2013.81ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 75.1MB in the end (delta: 34.4MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2025-03-08 09:46:38,357 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:38,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.82ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 96.1MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:46:38,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.43ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:38,358 INFO L158 Benchmark]: Boogie Preprocessor took 28.45ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:38,358 INFO L158 Benchmark]: IcfgBuilder took 337.28ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 72.0MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:46:38,359 INFO L158 Benchmark]: TraceAbstraction took 1404.11ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 75.2MB in the end (delta: -3.4MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2025-03-08 09:46:38,359 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 75.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:38,360 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.50ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.82ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 96.1MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.43ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.45ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 337.28ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 72.0MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1404.11ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 75.2MB in the end (delta: -3.4MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 75.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 73, overapproximation of someBinaryArithmeticDOUBLEoperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] signed char last_1_var_1_8 = -10; [L41] signed short int last_1_var_1_21 = -50; [L42] unsigned char last_1_var_1_23 = 1; VAL [isInitial=0, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L126] last_1_var_1_8 = var_1_8 [L127] last_1_var_1_21 = var_1_21 [L128] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L92] var_1_4 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L93] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_5=31/20, var_1_8=-10] [L94] var_1_5 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L95] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L96] var_1_10 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L97] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L98] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L98] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L99] var_1_11 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L100] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L101] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L101] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L102] var_1_12 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L103] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L104] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L104] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L105] var_1_14 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L106] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L107] var_1_15 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L108] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L109] var_1_17 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L110] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L111] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L111] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L112] var_1_18 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L113] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L114] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L114] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L115] var_1_19 = __VERIFIER_nondet_ulong() [L116] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L116] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L117] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L117] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L118] var_1_20 = __VERIFIER_nondet_ulong() [L119] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L119] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L120] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L120] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L121] var_1_24 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_8=-10] [L122] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_8=-10] [L123] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L123] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L139] RET updateVariables() [L140] CALL step() [L46] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=-10] [L47] COND TRUE \read(last_1_var_1_23) [L48] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_8=4] [L53] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L54] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L55] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=1, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L63] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=1, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_1=79/5, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L72] COND TRUE var_1_8 >= var_1_16 [L73] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=1, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L79] COND TRUE 128u >= var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_13=2571/20, var_1_16=1, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L80] COND TRUE ! var_1_23 [L81] var_1_13 = ((var_1_14 - var_1_15) + 0.25) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L131-L132] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=20, var_1_11=7, var_1_12=13, var_1_16=1, var_1_17=0, var_1_18=2147483647, var_1_19=4294967296, var_1_20=-4294967295, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_8=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 133 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 131 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=1, InterpolantAutomatonStates: 4, 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, 31 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:46:38,376 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_dependencies_file-24.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 795459c0c834c16bef89c6838cfefc476fabdd03a6889939ce2891ebae8af37f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:46:40,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:46:40,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:46:40,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:46:40,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:46:40,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:46:40,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:46:40,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:46:40,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:46:40,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:46:40,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:46:40,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:46:40,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:46:40,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:46:40,258 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:46:40,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:46:40,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:46:40,259 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:46:40,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:46:40,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:46:40,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:46:40,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:46:40,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:46:40,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:46:40,260 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:46:40,260 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:46:40,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:46:40,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:46:40,260 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:46:40,260 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:46:40,260 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:46:40,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:46:40,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:46:40,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:46:40,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:40,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:46:40,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:46:40,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:46:40,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:46:40,262 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:46:40,262 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:46:40,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:46:40,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:46:40,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:46:40,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:46:40,262 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 -> 795459c0c834c16bef89c6838cfefc476fabdd03a6889939ce2891ebae8af37f [2025-03-08 09:46:40,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:46:40,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:46:40,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:46:40,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:46:40,509 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:46:40,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-24.i [2025-03-08 09:46:41,619 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2988cede/f0dee4035e7a4ce09b6b7ee8b68f2394/FLAG3cad95352 [2025-03-08 09:46:41,842 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:46:41,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-24.i [2025-03-08 09:46:41,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2988cede/f0dee4035e7a4ce09b6b7ee8b68f2394/FLAG3cad95352 [2025-03-08 09:46:41,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2988cede/f0dee4035e7a4ce09b6b7ee8b68f2394 [2025-03-08 09:46:41,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:46:41,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:46:41,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:41,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:46:41,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:46:41,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:41" (1/1) ... [2025-03-08 09:46:41,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1bb135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:41, skipping insertion in model container [2025-03-08 09:46:41,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:41" (1/1) ... [2025-03-08 09:46:41,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:46:41,971 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_dependencies_file-24.i[919,932] [2025-03-08 09:46:42,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:42,012 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:46:42,019 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_dependencies_file-24.i[919,932] [2025-03-08 09:46:42,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:42,050 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:46:42,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42 WrapperNode [2025-03-08 09:46:42,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:42,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:42,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:46:42,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:46:42,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,081 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-08 09:46:42,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:42,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:46:42,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:46:42,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:46:42,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,105 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:46:42,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:46:42,121 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:46:42,121 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:46:42,121 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:46:42,122 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (1/1) ... [2025-03-08 09:46:42,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:42,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:42,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:46:42,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:46:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:46:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:46:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:46:42,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:46:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:46:42,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:46:42,242 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:46:42,244 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:46:44,912 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:46:44,912 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:46:44,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:46:44,919 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:46:44,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:44 BoogieIcfgContainer [2025-03-08 09:46:44,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:46:44,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:46:44,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:46:44,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:46:44,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:46:41" (1/3) ... [2025-03-08 09:46:44,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72eea132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:44, skipping insertion in model container [2025-03-08 09:46:44,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:42" (2/3) ... [2025-03-08 09:46:44,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72eea132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:44, skipping insertion in model container [2025-03-08 09:46:44,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:44" (3/3) ... [2025-03-08 09:46:44,927 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-24.i [2025-03-08 09:46:44,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:46:44,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-24.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:46:44,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:46:44,983 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;@470eab60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:46:44,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:46:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 09:46:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 09:46:44,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:44,994 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:44,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:44,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1888954687, now seen corresponding path program 1 times [2025-03-08 09:46:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:46:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112297888] [2025-03-08 09:46:45,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:46:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:46:45,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:46:45,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 09:46:45,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 09:46:45,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 09:46:45,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:45,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:45,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:46:45,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:46:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-08 09:46:45,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:46:45,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:46:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112297888] [2025-03-08 09:46:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112297888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:45,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:45,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:46:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940774611] [2025-03-08 09:46:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:45,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:46:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:46:45,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:46:45,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:46:45,366 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 09:46:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:45,383 INFO L93 Difference]: Finished difference Result 120 states and 207 transitions. [2025-03-08 09:46:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:46:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-03-08 09:46:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:45,388 INFO L225 Difference]: With dead ends: 120 [2025-03-08 09:46:45,388 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 09:46:45,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:46:45,393 INFO L435 NwaCegarLoop]: 91 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, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:45,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:46:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 09:46:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-08 09:46:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 09:46:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2025-03-08 09:46:45,422 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 128 [2025-03-08 09:46:45,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:45,422 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2025-03-08 09:46:45,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 09:46:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2025-03-08 09:46:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 09:46:45,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:45,424 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:45,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 09:46:45,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:46:45,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:45,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1367748095, now seen corresponding path program 1 times [2025-03-08 09:46:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:46:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029130803] [2025-03-08 09:46:45,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:45,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:46:45,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:46:45,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:46:45,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 09:46:45,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 09:46:45,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 09:46:45,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:45,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:45,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 09:46:45,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:46:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 09:46:46,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:46:46,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:46:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029130803] [2025-03-08 09:46:46,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029130803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:46,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:46,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:46:46,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307299431] [2025-03-08 09:46:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:46,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:46:46,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:46:46,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:46:46,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:46:46,985 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:46:49,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:46:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:49,717 INFO L93 Difference]: Finished difference Result 191 states and 293 transitions. [2025-03-08 09:46:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:46:49,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-08 09:46:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:49,738 INFO L225 Difference]: With dead ends: 191 [2025-03-08 09:46:49,738 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 09:46:49,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:46:49,739 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 73 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:49,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 259 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 09:46:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 09:46:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2025-03-08 09:46:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 09:46:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 174 transitions. [2025-03-08 09:46:49,771 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 174 transitions. Word has length 128 [2025-03-08 09:46:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:49,772 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 174 transitions. [2025-03-08 09:46:49,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:46:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 174 transitions. [2025-03-08 09:46:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 09:46:49,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:49,774 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:46:49,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 09:46:49,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:46:49,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:49,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash -119958983, now seen corresponding path program 1 times [2025-03-08 09:46:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:46:49,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982173836] [2025-03-08 09:46:49,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:49,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:46:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:46:49,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:46:49,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 09:46:50,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 09:46:50,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 09:46:50,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:50,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:50,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 09:46:50,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:48:08,597 WARN L286 SmtUtils]: Spent 24.00s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)