./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.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 d48f2c1830cdd6ac90cdee4bcb795720c0a52828893f188513897f8df44010d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:36:35,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:36:35,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:36:35,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:36:35,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:36:35,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:36:35,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:36:35,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:36:35,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:36:35,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:36:35,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:36:35,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:36:35,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:36:35,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:36:35,520 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:36:35,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:36:35,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:36:35,520 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:36:35,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:36:35,521 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:36:35,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:36:35,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:36:35,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:36:35,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:36:35,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:35,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:36:35,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:36:35,523 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 -> d48f2c1830cdd6ac90cdee4bcb795720c0a52828893f188513897f8df44010d8 [2025-03-03 22:36:35,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:36:35,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:36:35,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:36:35,767 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:36:35,768 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:36:35,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i [2025-03-03 22:36:36,948 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1304606e3/26fe79289ed14d12a56b6d44f89385a2/FLAG61ac01d78 [2025-03-03 22:36:37,245 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:36:37,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i [2025-03-03 22:36:37,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1304606e3/26fe79289ed14d12a56b6d44f89385a2/FLAG61ac01d78 [2025-03-03 22:36:37,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1304606e3/26fe79289ed14d12a56b6d44f89385a2 [2025-03-03 22:36:37,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:36:37,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:36:37,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:37,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:36:37,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:36:37,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37, skipping insertion in model container [2025-03-03 22:36:37,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:36:37,681 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_floatingpointinfluence_no-floats_file-50.i[916,929] [2025-03-03 22:36:37,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:37,736 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:36:37,743 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_floatingpointinfluence_no-floats_file-50.i[916,929] [2025-03-03 22:36:37,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:37,773 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:36:37,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37 WrapperNode [2025-03-03 22:36:37,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:37,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:37,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:36:37,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:36:37,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,799 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2025-03-03 22:36:37,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:37,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:36:37,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:36:37,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:36:37,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:36:37,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:36:37,829 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:36:37,829 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:36:37,829 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:36:37,830 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (1/1) ... [2025-03-03 22:36:37,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:37,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:37,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:36:37,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:36:37,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:36:37,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:36:37,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:36:37,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:36:37,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:36:37,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:36:37,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:36:37,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:36:38,174 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 22:36:38,174 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:36:38,181 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:36:38,184 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:36:38,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:38 BoogieIcfgContainer [2025-03-03 22:36:38,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:36:38,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:36:38,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:36:38,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:36:38,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:37" (1/3) ... [2025-03-03 22:36:38,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de7a564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:38, skipping insertion in model container [2025-03-03 22:36:38,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:37" (2/3) ... [2025-03-03 22:36:38,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de7a564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:38, skipping insertion in model container [2025-03-03 22:36:38,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:38" (3/3) ... [2025-03-03 22:36:38,193 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-50.i [2025-03-03 22:36:38,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:36:38,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-50.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:36:38,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:36:38,249 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;@3af4ca02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:36:38,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:36:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:36:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:36:38,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:38,262 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:38,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:38,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1416589062, now seen corresponding path program 1 times [2025-03-03 22:36:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921855530] [2025-03-03 22:36:38,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:38,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:36:38,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:36:38,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:38,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 22:36:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921855530] [2025-03-03 22:36:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921855530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:36:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884164391] [2025-03-03 22:36:38,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:38,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:36:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:38,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:36:38,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:36:38,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:36:38,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:36:38,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:38,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:38,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:36:38,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 22:36:38,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884164391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:36:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:36:38,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352628338] [2025-03-03 22:36:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:38,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:36:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:38,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:36:38,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:38,713 INFO L87 Difference]: Start difference. First operand has 71 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:36:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:38,730 INFO L93 Difference]: Finished difference Result 136 states and 241 transitions. [2025-03-03 22:36:38,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:36:38,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 179 [2025-03-03 22:36:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:38,737 INFO L225 Difference]: With dead ends: 136 [2025-03-03 22:36:38,737 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 22:36:38,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:38,743 INFO L435 NwaCegarLoop]: 103 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, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:38,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:36:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 22:36:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 22:36:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:36:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2025-03-03 22:36:38,776 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 179 [2025-03-03 22:36:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:38,776 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2025-03-03 22:36:38,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:36:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2025-03-03 22:36:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:36:38,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:38,779 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:38,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:36:38,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:36:38,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:38,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash 164516774, now seen corresponding path program 1 times [2025-03-03 22:36:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:38,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577604768] [2025-03-03 22:36:38,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:39,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:36:39,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:36:39,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:39,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:36:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:39,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577604768] [2025-03-03 22:36:39,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577604768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:39,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:39,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:36:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980485049] [2025-03-03 22:36:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:39,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:36:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:39,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:36:39,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:36:39,358 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:36:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:39,552 INFO L93 Difference]: Finished difference Result 209 states and 317 transitions. [2025-03-03 22:36:39,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:36:39,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 179 [2025-03-03 22:36:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:39,555 INFO L225 Difference]: With dead ends: 209 [2025-03-03 22:36:39,555 INFO L226 Difference]: Without dead ends: 144 [2025-03-03 22:36:39,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:36:39,556 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 62 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:39,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 405 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:36:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-03 22:36:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2025-03-03 22:36:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:36:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2025-03-03 22:36:39,575 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 179 [2025-03-03 22:36:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:39,576 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2025-03-03 22:36:39,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:36:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2025-03-03 22:36:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:36:39,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:39,581 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:39,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:36:39,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:39,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1642937689, now seen corresponding path program 1 times [2025-03-03 22:36:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619249172] [2025-03-03 22:36:39,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:39,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:36:39,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:36:39,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:39,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:39,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:36:39,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:36:39,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:36:39,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:39,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:39,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:36:39,839 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:36:39,840 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:36:39,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:36:39,845 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:36:39,924 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:36:39,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:36:39 BoogieIcfgContainer [2025-03-03 22:36:39,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:36:39,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:36:39,927 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:36:39,927 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:36:39,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:38" (3/4) ... [2025-03-03 22:36:39,929 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:36:39,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:36:39,931 INFO L158 Benchmark]: Toolchain (without parser) took 2393.58ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 102.4MB in the end (delta: 21.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-03-03 22:36:39,931 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:39,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.54ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 109.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:36:39,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.10ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 107.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:39,931 INFO L158 Benchmark]: Boogie Preprocessor took 28.10ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:39,932 INFO L158 Benchmark]: IcfgBuilder took 355.29ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 88.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:36:39,932 INFO L158 Benchmark]: TraceAbstraction took 1740.15ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 102.4MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:39,932 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 102.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:39,933 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.32ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.54ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 109.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.10ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 107.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.10ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.29ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 88.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1740.15ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 102.4MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 102.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed long int var_1_2 = 8; [L24] signed long int var_1_3 = 63; [L25] signed long int var_1_4 = 16; [L26] signed long int var_1_5 = 127; [L27] unsigned char var_1_9 = 1; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 0; [L30] signed short int var_1_12 = -2; [L31] signed short int var_1_13 = 64; [L32] signed short int var_1_14 = 2; [L33] signed short int var_1_15 = 4; [L34] signed short int var_1_16 = 26204; [L35] signed short int var_1_17 = 5; [L36] signed long int var_1_18 = -5; [L37] signed long int var_1_19 = 100; [L38] signed long int var_1_20 = 0; [L39] signed long int var_1_21 = 128; [L40] signed long int last_1_var_1_18 = -5; VAL [isInitial=0, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=8, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L122] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=8, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L76] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L77] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=63, var_1_4=16, var_1_5=127, var_1_9=1] [L78] var_1_3 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L79] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L80] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=127, var_1_9=1] [L81] var_1_4 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=127, var_1_9=1] [L84] var_1_5 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L86] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L87] var_1_9 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0] [L88] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0] [L89] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L90] var_1_10 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L95] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L96] var_1_13 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_13 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_13 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L99] var_1_14 = __VERIFIER_nondet_short() [L100] CALL assume_abort_if_not(var_1_14 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_14 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L102] var_1_15 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L103] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L104] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L105] var_1_16 = __VERIFIER_nondet_short() [L106] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L106] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L107] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L108] var_1_17 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L109] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L110] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L110] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L111] var_1_19 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L112] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L113] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L114] var_1_20 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_20 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L116] RET assume_abort_if_not(var_1_20 <= 536870911) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L117] var_1_21 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L119] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L133] RET updateVariables() [L134] CALL step() [L44] signed long int stepLocal_1 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_1=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L45] COND FALSE !(stepLocal_1 >= 0) [L48] var_1_12 = ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-3, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L50] signed long int stepLocal_3 = var_1_15 - var_1_19; [L51] signed short int stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=-3, stepLocal_3=-3, var_1_10=1, var_1_11=-256, var_1_12=-3, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=-5, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L52] COND FALSE !(var_1_12 > stepLocal_3) [L57] var_1_18 = var_1_14 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=-3, var_1_10=1, var_1_11=-256, var_1_12=-3, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=32766, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L59] signed long int stepLocal_0 = (((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18)); VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=32766, stepLocal_2=-3, var_1_10=1, var_1_11=-256, var_1_12=-3, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=32766, var_1_19=32765, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L60] COND FALSE !((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) [L71] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=32766, stepLocal_2=-3, var_1_10=1, var_1_11=-256, var_1_12=-3, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=32766, var_1_19=32765, var_1_1=-256, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L134] RET step() [L135] CALL, EXPR property() [L125-L126] return ((((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) ? ((((((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18))) < var_1_18) ? (var_1_9 ? (var_1_1 == ((unsigned char) var_1_10)) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_11))) && ((last_1_var_1_18 >= 0) ? (var_1_12 == ((signed short int) ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))))) : (var_1_12 == ((signed short int) ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && ((var_1_12 > (var_1_15 - var_1_19)) ? ((var_1_13 < var_1_12) ? (var_1_18 == ((signed long int) ((var_1_17 + (var_1_16 + var_1_20)) - var_1_21))) : 1) : (var_1_18 == ((signed long int) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-3, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=32766, var_1_19=32765, var_1_1=-256, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-3, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=32766, var_1_19=32765, var_1_1=-256, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-3, var_1_13=-3, var_1_14=32766, var_1_15=32762, var_1_16=32766, var_1_17=0, var_1_18=32766, var_1_19=32765, var_1_1=-256, var_1_20=536870911, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 508 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 211 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 5162/5220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:36:39,948 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_floatingpointinfluence_no-floats_file-50.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 d48f2c1830cdd6ac90cdee4bcb795720c0a52828893f188513897f8df44010d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:36:41,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:36:41,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:36:41,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:36:41,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:36:41,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:36:41,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:36:41,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:36:41,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:36:41,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:36:41,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:36:41,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:36:41,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:36:41,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:36:41,997 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:36:41,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:36:41,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:36:41,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:36:41,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:36:41,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:36:41,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:36:42,000 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:36:42,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:36:42,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:36:42,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:36:42,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:42,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:36:42,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:36:42,001 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 -> d48f2c1830cdd6ac90cdee4bcb795720c0a52828893f188513897f8df44010d8 [2025-03-03 22:36:42,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:36:42,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:36:42,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:36:42,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:36:42,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:36:42,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i [2025-03-03 22:36:43,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ffb2f51/701e51bb44f2476abbc7587ddd1cdb52/FLAG280e5aa14 [2025-03-03 22:36:43,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:36:43,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-50.i [2025-03-03 22:36:43,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ffb2f51/701e51bb44f2476abbc7587ddd1cdb52/FLAG280e5aa14 [2025-03-03 22:36:43,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ffb2f51/701e51bb44f2476abbc7587ddd1cdb52 [2025-03-03 22:36:43,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:36:43,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:36:43,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:43,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:36:43,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:36:43,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b356991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43, skipping insertion in model container [2025-03-03 22:36:43,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:36:43,912 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_floatingpointinfluence_no-floats_file-50.i[916,929] [2025-03-03 22:36:43,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:43,979 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:36:43,986 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_floatingpointinfluence_no-floats_file-50.i[916,929] [2025-03-03 22:36:44,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:44,026 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:36:44,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44 WrapperNode [2025-03-03 22:36:44,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:44,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:44,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:36:44,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:36:44,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,066 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-03-03 22:36:44,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:44,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:36:44,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:36:44,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:36:44,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,096 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:36:44,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:36:44,121 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:36:44,121 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:36:44,121 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:36:44,122 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (1/1) ... [2025-03-03 22:36:44,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:44,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:44,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:36:44,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:36:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:36:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:36:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:36:44,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:36:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:36:44,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:36:44,241 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:36:44,243 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:36:44,802 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 22:36:44,802 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:36:44,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:36:44,811 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:36:44,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:44 BoogieIcfgContainer [2025-03-03 22:36:44,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:36:44,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:36:44,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:36:44,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:36:44,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:43" (1/3) ... [2025-03-03 22:36:44,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462fa673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:44, skipping insertion in model container [2025-03-03 22:36:44,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:44" (2/3) ... [2025-03-03 22:36:44,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462fa673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:44, skipping insertion in model container [2025-03-03 22:36:44,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:44" (3/3) ... [2025-03-03 22:36:44,821 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-50.i [2025-03-03 22:36:44,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:36:44,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-50.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:36:44,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:36:44,893 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;@57a8c648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:36:44,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:36:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:36:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:36:44,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:44,911 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:44,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1416589062, now seen corresponding path program 1 times [2025-03-03 22:36:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:44,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957177577] [2025-03-03 22:36:44,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:44,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:44,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:44,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:36:44,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:36:45,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:36:45,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:36:45,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:45,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:45,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:36:45,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2025-03-03 22:36:45,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:45,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:36:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957177577] [2025-03-03 22:36:45,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957177577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:45,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:45,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:36:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61416410] [2025-03-03 22:36:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:45,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:36:45,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:36:45,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:36:45,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:45,161 INFO L87 Difference]: Start difference. First operand has 71 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:36:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:45,180 INFO L93 Difference]: Finished difference Result 136 states and 241 transitions. [2025-03-03 22:36:45,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:36:45,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 179 [2025-03-03 22:36:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:45,185 INFO L225 Difference]: With dead ends: 136 [2025-03-03 22:36:45,185 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 22:36:45,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:45,190 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:45,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:36:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 22:36:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 22:36:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 22:36:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2025-03-03 22:36:45,224 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 179 [2025-03-03 22:36:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:45,224 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2025-03-03 22:36:45,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 22:36:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2025-03-03 22:36:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 22:36:45,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:45,228 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:45,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:36:45,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:45,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:45,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash 836513953, now seen corresponding path program 1 times [2025-03-03 22:36:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:45,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018463253] [2025-03-03 22:36:45,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:45,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:45,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:36:45,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:36:45,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 22:36:45,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 22:36:45,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:45,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:45,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:36:45,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:36:46,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:46,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:36:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018463253] [2025-03-03 22:36:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018463253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:46,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:46,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:36:46,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199275378] [2025-03-03 22:36:46,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:46,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:36:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:36:46,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:36:46,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:36:46,008 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:36:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:46,660 INFO L93 Difference]: Finished difference Result 209 states and 313 transitions. [2025-03-03 22:36:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:36:46,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 180 [2025-03-03 22:36:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:46,675 INFO L225 Difference]: With dead ends: 209 [2025-03-03 22:36:46,675 INFO L226 Difference]: Without dead ends: 144 [2025-03-03 22:36:46,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:36:46,676 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 57 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:46,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 399 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:36:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-03 22:36:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2025-03-03 22:36:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 68 states have (on average 1.161764705882353) internal successors, (79), 68 states have internal predecessors, (79), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:36:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-03 22:36:46,711 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 180 [2025-03-03 22:36:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:46,712 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-03 22:36:46,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:36:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-03 22:36:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 22:36:46,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:46,716 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:46,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 22:36:46,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:46,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:46,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash 640000448, now seen corresponding path program 1 times [2025-03-03 22:36:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996063631] [2025-03-03 22:36:46,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:46,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:46,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:46,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:36:46,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 22:36:46,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 22:36:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 22:36:47,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:47,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:47,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:36:47,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:37:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 22:37:52,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:37:52,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:37:52,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996063631] [2025-03-03 22:37:52,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996063631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:52,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:52,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:37:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400623847] [2025-03-03 22:37:52,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:52,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:37:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:37:52,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:37:52,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:37:52,413 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:37:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:54,923 INFO L93 Difference]: Finished difference Result 182 states and 266 transitions. [2025-03-03 22:37:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:37:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 180 [2025-03-03 22:37:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:54,932 INFO L225 Difference]: With dead ends: 182 [2025-03-03 22:37:54,932 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 22:37:54,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:37:54,933 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:54,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 665 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 22:37:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 22:37:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2025-03-03 22:37:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 87 states have internal predecessors, (99), 74 states have call successors, (74), 3 states have call predecessors, (74), 3 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 22:37:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2025-03-03 22:37:54,961 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 180 [2025-03-03 22:37:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:54,961 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2025-03-03 22:37:54,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 22:37:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2025-03-03 22:37:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 22:37:54,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:54,963 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:54,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 22:37:55,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:37:55,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:55,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash -723243482, now seen corresponding path program 1 times [2025-03-03 22:37:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:37:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570636154] [2025-03-03 22:37:55,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:55,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:37:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:37:55,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:37:55,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 22:37:55,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 22:37:55,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 22:37:55,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:55,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:55,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 22:37:55,369 INFO L279 TraceCheckSpWp]: Computing forward predicates...