./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.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-8.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 c4c3ca4cdaeebd4b3f15c91e6de8a01b99c28f02b0f115bb52bbf7a342cc37eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:53:18,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:53:18,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:53:18,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:53:18,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:53:18,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:53:18,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:53:18,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:53:18,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:53:18,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:53:18,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:53:18,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:53:18,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:53:18,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:53:18,102 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:53:18,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:53:18,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:53:18,102 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:53:18,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:53:18,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:53:18,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:53:18,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:53:18,104 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 -> c4c3ca4cdaeebd4b3f15c91e6de8a01b99c28f02b0f115bb52bbf7a342cc37eb [2025-03-08 09:53:18,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:53:18,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:53:18,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:53:18,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:53:18,333 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:53:18,333 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-8.i [2025-03-08 09:53:19,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15da1e176/405a9750f83f409e872cc821d42b8c50/FLAG62c66daac [2025-03-08 09:53:19,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:53:19,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i [2025-03-08 09:53:19,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15da1e176/405a9750f83f409e872cc821d42b8c50/FLAG62c66daac [2025-03-08 09:53:19,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15da1e176/405a9750f83f409e872cc821d42b8c50 [2025-03-08 09:53:19,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:53:19,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:53:19,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:53:19,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:53:19,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:53:19,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:19,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f93a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19, skipping insertion in model container [2025-03-08 09:53:19,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:19,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:53:19,863 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-8.i[918,931] [2025-03-08 09:53:19,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:53:19,927 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:53:19,935 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-8.i[918,931] [2025-03-08 09:53:19,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:53:19,975 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:53:19,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19 WrapperNode [2025-03-08 09:53:19,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:53:19,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:53:19,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:53:19,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:53:19,980 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:53:19" (1/1) ... [2025-03-08 09:53:19,986 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:53:19" (1/1) ... [2025-03-08 09:53:20,014 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-08 09:53:20,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:53:20,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:53:20,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:53:20,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:53:20,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,040 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:53:20,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,049 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:53:20,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:53:20,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:53:20,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:53:20,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (1/1) ... [2025-03-08 09:53:20,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:53:20,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:53:20,085 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:53:20,090 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:53:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:53:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:53:20,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:53:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:53:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:53:20,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:53:20,159 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:53:20,160 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:53:20,406 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:53:20,406 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:53:20,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:53:20,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:53:20,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:53:20 BoogieIcfgContainer [2025-03-08 09:53:20,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:53:20,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:53:20,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:53:20,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:53:20,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:53:19" (1/3) ... [2025-03-08 09:53:20,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a04bc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:53:20, skipping insertion in model container [2025-03-08 09:53:20,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:19" (2/3) ... [2025-03-08 09:53:20,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a04bc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:53:20, skipping insertion in model container [2025-03-08 09:53:20,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:53:20" (3/3) ... [2025-03-08 09:53:20,421 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-8.i [2025-03-08 09:53:20,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:53:20,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-8.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:53:20,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:53:20,478 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;@abb4ce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:53:20,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:53:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 09:53:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:53:20,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:53:20,491 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:20,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:53:20,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:53:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2052454261, now seen corresponding path program 1 times [2025-03-08 09:53:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:53:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629990800] [2025-03-08 09:53:20,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:53:20,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:53:20,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:20,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:20,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:20,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:53:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 09:53:20,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:53:20,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629990800] [2025-03-08 09:53:20,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629990800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:53:20,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032714165] [2025-03-08 09:53:20,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:53:20,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:53:20,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:53:20,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:53:20,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:53:20,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:20,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:20,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:53:20,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:53:20,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:53:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 09:53:20,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:53:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032714165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:53:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:53:20,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:53:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173321975] [2025-03-08 09:53:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:53:20,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:53:20,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:53:20,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:53:20,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:53:20,931 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:53:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:53:20,946 INFO L93 Difference]: Finished difference Result 124 states and 220 transitions. [2025-03-08 09:53:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:53:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 09:53:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:53:20,951 INFO L225 Difference]: With dead ends: 124 [2025-03-08 09:53:20,951 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 09:53:20,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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:53:20,955 INFO L435 NwaCegarLoop]: 95 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, 95 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:53:20,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:53:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 09:53:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 09:53:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 09:53:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2025-03-08 09:53:20,986 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 143 [2025-03-08 09:53:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:53:20,987 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2025-03-08 09:53:20,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:53:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2025-03-08 09:53:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:53:20,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:53:20,991 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:20,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:53:21,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 09:53:21,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:53:21,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:53:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1738540718, now seen corresponding path program 1 times [2025-03-08 09:53:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:53:21,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792745305] [2025-03-08 09:53:21,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:53:21,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:53:21,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:21,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:21,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:21,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:53:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 09:53:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:53:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792745305] [2025-03-08 09:53:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792745305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:53:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124717914] [2025-03-08 09:53:21,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:53:21,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:53:21,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:53:21,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:53:21,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:53:21,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:22,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:53:22,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 09:53:22,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:53:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-08 09:53:22,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:53:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124717914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:53:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:53:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 15 [2025-03-08 09:53:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865103108] [2025-03-08 09:53:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:53:22,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 09:53:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:53:22,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 09:53:22,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:53:22,666 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:53:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:53:23,892 INFO L93 Difference]: Finished difference Result 397 states and 587 transitions. [2025-03-08 09:53:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-08 09:53:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 09:53:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:53:23,895 INFO L225 Difference]: With dead ends: 397 [2025-03-08 09:53:23,896 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 09:53:23,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1627, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 09:53:23,898 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 272 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:53:23,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 588 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:53:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 09:53:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 196. [2025-03-08 09:53:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 119 states have internal predecessors, (156), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 09:53:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 294 transitions. [2025-03-08 09:53:23,959 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 294 transitions. Word has length 143 [2025-03-08 09:53:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:53:23,959 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 294 transitions. [2025-03-08 09:53:23,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:53:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 294 transitions. [2025-03-08 09:53:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:53:23,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:53:23,961 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:23,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 09:53:24,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 09:53:24,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:53:24,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:53:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1709911567, now seen corresponding path program 1 times [2025-03-08 09:53:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:53:24,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977314199] [2025-03-08 09:53:24,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:53:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:53:24,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:24,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:24,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:24,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 09:53:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646263417] [2025-03-08 09:53:24,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:53:24,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:53:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:53:24,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:53:24,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:53:24,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:24,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:24,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:24,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:53:24,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:53:24,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:24,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:24,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:24,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:53:24,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:53:24,975 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:53:24,976 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:53:24,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 09:53:25,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:53:25,180 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 09:53:25,251 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:53:25,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:53:25 BoogieIcfgContainer [2025-03-08 09:53:25,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:53:25,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:53:25,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:53:25,257 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:53:25,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:53:20" (3/4) ... [2025-03-08 09:53:25,260 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:53:25,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:53:25,261 INFO L158 Benchmark]: Toolchain (without parser) took 5515.80ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.6MB in the beginning and 161.0MB in the end (delta: -48.4MB). Peak memory consumption was 238.5MB. Max. memory is 16.1GB. [2025-03-08 09:53:25,262 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:53:25,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.68ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 98.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:53:25,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.76ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 94.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:53:25,263 INFO L158 Benchmark]: Boogie Preprocessor took 42.36ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 87.6MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:53:25,263 INFO L158 Benchmark]: IcfgBuilder took 355.66ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 64.5MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:53:25,263 INFO L158 Benchmark]: TraceAbstraction took 4840.56ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 64.0MB in the beginning and 161.0MB in the end (delta: -97.0MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2025-03-08 09:53:25,263 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 427.8MB. Free memory was 161.0MB in the beginning and 161.0MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:53:25,264 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.68ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 98.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.76ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 94.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.36ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 87.6MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 355.66ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 64.5MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4840.56ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 64.0MB in the beginning and 161.0MB in the end (delta: -97.0MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 427.8MB. Free memory was 161.0MB in the beginning and 161.0MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999999999.675; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] unsigned long int var_1_9 = 1; [L28] double var_1_10 = 63.25; [L29] unsigned char var_1_11 = 0; [L30] unsigned short int var_1_13 = 0; [L31] unsigned short int var_1_15 = 17766; [L32] unsigned short int var_1_16 = 28149; [L33] unsigned char var_1_19 = 4; [L34] unsigned char var_1_20 = 50; [L35] unsigned char var_1_21 = 64; [L36] unsigned char var_1_22 = 50; [L37] unsigned char var_1_23 = 5; [L38] unsigned char var_1_24 = 128; [L39] signed long int var_1_25 = -16; [L40] unsigned char var_1_26 = 0; [L41] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L127] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L90] var_1_4 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L91] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L92] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L93] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L94] var_1_5 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L95] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L96] var_1_6 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L97] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L98] var_1_10 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L99] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L100] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L103] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L104] var_1_15 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L105] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L106] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L107] var_1_16 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L108] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L109] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L110] var_1_20 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_20 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L111] RET assume_abort_if_not(var_1_20 >= 32) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L112] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L113] var_1_21 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_21 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L114] RET assume_abort_if_not(var_1_21 >= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L115] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L116] var_1_22 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L117] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_22 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L118] RET assume_abort_if_not(var_1_22 <= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L119] var_1_23 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L120] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L121] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L122] var_1_24 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L123] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L124] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L138] RET updateVariables() [L139] CALL step() [L45] COND TRUE last_1_var_1_13 == (last_1_var_1_13 % var_1_4) [L46] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L48] COND FALSE !(var_1_10 == var_1_1) [L55] var_1_19 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L57] COND FALSE !(var_1_19 < (var_1_21 / var_1_20)) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=-2, var_1_9=1] [L64] COND TRUE var_1_1 >= var_1_6 [L65] var_1_7 = var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L67] COND FALSE !(((var_1_6 * var_1_5) / var_1_10) > var_1_1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L74] COND FALSE !(var_1_7 < var_1_9) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L77] COND FALSE !((25.3 * var_1_5) != var_1_1) [L86] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return (((((((last_1_var_1_13 == (last_1_var_1_13 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((var_1_1 >= var_1_6) ? (var_1_7 == ((signed long int) var_1_19)) : 1)) && ((((var_1_6 * var_1_5) / var_1_10) > var_1_1) ? (var_1_11 ? (var_1_9 == ((unsigned long int) var_1_26)) : (var_1_9 == ((unsigned long int) var_1_26))) : 1)) && ((var_1_7 < var_1_9) ? (var_1_13 == ((unsigned short int) (var_1_26 + (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - (var_1_19 + var_1_19))))) : 1)) && ((var_1_10 == var_1_1) ? (var_1_11 ? (var_1_19 == ((unsigned char) (((32 + var_1_20) + var_1_21) - (var_1_22 + var_1_23)))) : (var_1_19 == ((unsigned char) (var_1_24 - var_1_23)))) : (var_1_19 == ((unsigned char) var_1_24)))) && (((25.3 * var_1_5) != var_1_1) ? (var_1_11 ? ((var_1_15 <= var_1_13) ? (var_1_25 == ((signed long int) var_1_26)) : 1) : (var_1_25 == ((signed long int) var_1_22))) : (var_1_25 == ((signed long int) var_1_20)))) && ((var_1_19 < (var_1_21 / var_1_20)) ? ((var_1_19 > var_1_19) ? (var_1_26 == ((unsigned char) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (var_1_23)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (var_1_23))))) : (var_1_26 == ((unsigned char) var_1_22))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=63, var_1_21=64, var_1_22=0, var_1_23=31, var_1_24=127, var_1_25=63, var_1_26=0, var_1_4=-1, var_1_7=127, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 124 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 480 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 640 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 203 mSDtfsCounter, 640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=2, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 142 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 858 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 1180 SizeOfPredicates, 4 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 4001/4048 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:53:25,284 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-8.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 c4c3ca4cdaeebd4b3f15c91e6de8a01b99c28f02b0f115bb52bbf7a342cc37eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:53:27,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:53:27,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:53:27,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:53:27,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:53:27,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:53:27,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:53:27,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:53:27,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:53:27,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:53:27,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:53:27,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:53:27,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:53:27,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:53:27,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:53:27,258 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:53:27,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:53:27,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:53:27,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:53:27,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:53:27,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:53:27,259 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 -> c4c3ca4cdaeebd4b3f15c91e6de8a01b99c28f02b0f115bb52bbf7a342cc37eb [2025-03-08 09:53:27,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:53:27,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:53:27,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:53:27,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:53:27,531 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:53:27,532 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-8.i [2025-03-08 09:53:28,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a18a3ec/3b0ba87310fb41afa7bea374b158f7c2/FLAG04f643340 [2025-03-08 09:53:28,885 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:53:28,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-8.i [2025-03-08 09:53:28,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a18a3ec/3b0ba87310fb41afa7bea374b158f7c2/FLAG04f643340 [2025-03-08 09:53:29,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a18a3ec/3b0ba87310fb41afa7bea374b158f7c2 [2025-03-08 09:53:29,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:53:29,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:53:29,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:53:29,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:53:29,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:53:29,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87d39d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29, skipping insertion in model container [2025-03-08 09:53:29,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:53:29,402 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-8.i[918,931] [2025-03-08 09:53:29,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:53:29,473 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:53:29,481 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-8.i[918,931] [2025-03-08 09:53:29,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:53:29,526 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:53:29,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29 WrapperNode [2025-03-08 09:53:29,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:53:29,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:53:29,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:53:29,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:53:29,533 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:53:29" (1/1) ... [2025-03-08 09:53:29,540 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:53:29" (1/1) ... [2025-03-08 09:53:29,557 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-08 09:53:29,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:53:29,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:53:29,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:53:29,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:53:29,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,576 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:53:29,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,586 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:53:29,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:53:29,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:53:29,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:53:29,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (1/1) ... [2025-03-08 09:53:29,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:53:29,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:53:29,616 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:53:29,619 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:53:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:53:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:53:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:53:29,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:53:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:53:29,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:53:29,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:53:29,703 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:53:51,366 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:53:51,366 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:53:51,379 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:53:51,379 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:53:51,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:53:51 BoogieIcfgContainer [2025-03-08 09:53:51,380 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:53:51,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:53:51,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:53:51,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:53:51,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:53:29" (1/3) ... [2025-03-08 09:53:51,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a7af36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:53:51, skipping insertion in model container [2025-03-08 09:53:51,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:53:29" (2/3) ... [2025-03-08 09:53:51,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a7af36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:53:51, skipping insertion in model container [2025-03-08 09:53:51,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:53:51" (3/3) ... [2025-03-08 09:53:51,387 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-8.i [2025-03-08 09:53:51,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:53:51,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-8.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:53:51,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:53:51,445 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;@2e6936c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:53:51,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:53:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 09:53:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:53:51,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:53:51,461 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:51,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:53:51,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:53:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2052454261, now seen corresponding path program 1 times [2025-03-08 09:53:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:53:51,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356362701] [2025-03-08 09:53:51,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:53:51,473 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:53:51,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:53:51,476 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:53:51,477 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:53:51,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:52,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:52,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:52,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:53:52,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:53:52,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:53:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-03-08 09:53:52,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:53:52,554 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:53:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356362701] [2025-03-08 09:53:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356362701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:53:52,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:53:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:53:52,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828321213] [2025-03-08 09:53:52,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:53:52,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:53:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:53:52,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:53:52,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:53:52,577 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:53:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:53:52,597 INFO L93 Difference]: Finished difference Result 124 states and 220 transitions. [2025-03-08 09:53:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:53:52,599 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 09:53:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:53:52,603 INFO L225 Difference]: With dead ends: 124 [2025-03-08 09:53:52,603 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 09:53:52,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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:53:52,606 INFO L435 NwaCegarLoop]: 95 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, 95 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:53:52,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:53:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 09:53:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 09:53:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 09:53:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2025-03-08 09:53:52,638 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 143 [2025-03-08 09:53:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:53:52,638 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2025-03-08 09:53:52,639 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:53:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2025-03-08 09:53:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 09:53:52,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:53:52,642 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:52,671 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:53:52,843 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:53:52,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:53:52,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:53:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1738540718, now seen corresponding path program 1 times [2025-03-08 09:53:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:53:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098418420] [2025-03-08 09:53:52,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:53:52,846 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:53:52,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:53:52,849 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:53:52,850 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:53:52,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:53:53,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:53:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:53:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:53:53,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 09:53:53,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:54:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-08 09:54:01,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:54:02,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:54:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098418420] [2025-03-08 09:54:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098418420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:54:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [417231686] [2025-03-08 09:54:02,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:54:02,913 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 09:54:02,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 09:54:02,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 09:54:02,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-08 09:54:02,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 09:54:04,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 09:54:04,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:54:04,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:54:04,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 09:54:04,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:54:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-08 09:54:10,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:54:11,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [417231686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:54:11,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:54:11,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-03-08 09:54:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880442172] [2025-03-08 09:54:11,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:54:11,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:54:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:54:11,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:54:11,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:54:11,181 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 09:54:22,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 09:54:26,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 09:54:30,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 09:54:34,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:54:38,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:54:42,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:54:46,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 09:54:50,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:54:54,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:54:58,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 09:55:02,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []