./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-80.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_variablewrapping_normal_file-80.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 1afef333d2d5ce937d4e371f5893af89013ff82bbfaa9da10d02f3a397c05cb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:58:56,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:58:56,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:58:56,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:58:56,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:58:56,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:58:56,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:58:56,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:58:56,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:58:56,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:58:56,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:58:56,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:58:56,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:58:56,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:58:56,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:58:56,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:58:56,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:58:56,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:58:56,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:58:56,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:58:56,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:58:56,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:58:56,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:58:56,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:58:56,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:58:56,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:58:56,673 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 -> 1afef333d2d5ce937d4e371f5893af89013ff82bbfaa9da10d02f3a397c05cb5 [2025-03-04 00:58:56,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:58:56,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:58:56,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:58:56,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:58:56,908 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:58:56,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-80.i [2025-03-04 00:58:58,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b941a997a/f1f8aa97bab84667ba1e77bc684f398c/FLAG3bf0d96e4 [2025-03-04 00:58:58,274 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:58:58,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-80.i [2025-03-04 00:58:58,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b941a997a/f1f8aa97bab84667ba1e77bc684f398c/FLAG3bf0d96e4 [2025-03-04 00:58:58,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b941a997a/f1f8aa97bab84667ba1e77bc684f398c [2025-03-04 00:58:58,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:58:58,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:58:58,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:58:58,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:58:58,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:58:58,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58, skipping insertion in model container [2025-03-04 00:58:58,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:58:58,751 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_variablewrapping_normal_file-80.i[913,926] [2025-03-04 00:58:58,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:58:58,812 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:58:58,821 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_variablewrapping_normal_file-80.i[913,926] [2025-03-04 00:58:58,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:58:58,863 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:58:58,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58 WrapperNode [2025-03-04 00:58:58,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:58:58,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:58:58,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:58:58,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:58:58,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,903 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2025-03-04 00:58:58,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:58:58,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:58:58,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:58:58,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:58:58,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,933 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-04 00:58:58,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,944 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:58:58,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:58:58,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:58:58,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:58:58,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:58:58,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:58:58,979 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-04 00:58:58,984 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-04 00:58:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:58:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:58:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:58:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:58:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:58:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:58:59,056 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:58:59,058 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:58:59,229 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:58:59,229 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:58:59,239 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:58:59,239 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:58:59,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:58:59 BoogieIcfgContainer [2025-03-04 00:58:59,240 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:58:59,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:58:59,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:58:59,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:58:59,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:58:58" (1/3) ... [2025-03-04 00:58:59,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4358459c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:58:59, skipping insertion in model container [2025-03-04 00:58:59,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (2/3) ... [2025-03-04 00:58:59,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4358459c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:58:59, skipping insertion in model container [2025-03-04 00:58:59,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:58:59" (3/3) ... [2025-03-04 00:58:59,250 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-80.i [2025-03-04 00:58:59,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:58:59,264 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-80.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:58:59,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:58:59,323 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;@64d3d8df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:58:59,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:58:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 00:58:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 00:58:59,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:58:59,335 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:58:59,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:58:59,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:58:59,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2106099896, now seen corresponding path program 1 times [2025-03-04 00:58:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:58:59,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31137864] [2025-03-04 00:58:59,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:59,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:58:59,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 00:58:59,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 00:58:59,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:59,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:58:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 00:58:59,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:58:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31137864] [2025-03-04 00:58:59,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31137864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:58:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25964650] [2025-03-04 00:58:59,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:58:59,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:58:59,545 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-04 00:58:59,546 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-04 00:58:59,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 00:58:59,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 00:58:59,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:59,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:58:59,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:58:59,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:58:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 00:58:59,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:58:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25964650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:58:59,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:58:59,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:58:59,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590675522] [2025-03-04 00:58:59,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:58:59,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:58:59,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:58:59,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:58:59,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:58:59,703 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 00:58:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:58:59,718 INFO L93 Difference]: Finished difference Result 94 states and 154 transitions. [2025-03-04 00:58:59,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:58:59,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2025-03-04 00:58:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:58:59,724 INFO L225 Difference]: With dead ends: 94 [2025-03-04 00:58:59,724 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 00:58:59,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-04 00:58:59,738 INFO L435 NwaCegarLoop]: 66 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, 66 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-04 00:58:59,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:58:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 00:58:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 00:58:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 00:58:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-04 00:58:59,771 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 109 [2025-03-04 00:58:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:58:59,772 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-04 00:58:59,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 00:58:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-04 00:58:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 00:58:59,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:58:59,775 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:58:59,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:58:59,979 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-04 00:58:59,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:58:59,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:58:59,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1574967247, now seen corresponding path program 1 times [2025-03-04 00:58:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:58:59,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710098690] [2025-03-04 00:58:59,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:59,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:58:59,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 00:59:00,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 00:59:00,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:00,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:59:00,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658374046] [2025-03-04 00:59:00,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:00,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:59:00,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:59:00,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:59:00,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:59:00,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 00:59:00,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 00:59:00,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:00,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:59:00,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:59:00,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 00:59:00,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 00:59:00,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:00,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:59:00,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:59:00,427 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:59:00,428 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:59:00,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:59:00,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 00:59:00,632 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:59:00,700 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:59:00,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:59:00 BoogieIcfgContainer [2025-03-04 00:59:00,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:59:00,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:59:00,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:59:00,704 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:59:00,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:58:59" (3/4) ... [2025-03-04 00:59:00,706 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:59:00,706 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:59:00,707 INFO L158 Benchmark]: Toolchain (without parser) took 2082.69ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 69.9MB in the end (delta: 43.2MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-03-04 00:59:00,707 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:59:00,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.78ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 99.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:59:00,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.5MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:59:00,709 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:59:00,709 INFO L158 Benchmark]: IcfgBuilder took 287.59ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 77.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:59:00,709 INFO L158 Benchmark]: TraceAbstraction took 1457.53ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 69.9MB in the end (delta: 6.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2025-03-04 00:59:00,709 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory was 69.9MB in the beginning and 69.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:59:00,710 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.78ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 99.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.5MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 287.59ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 77.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1457.53ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 69.9MB in the end (delta: 6.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory was 69.9MB in the beginning and 69.9MB 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 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 256; [L23] signed long int var_1_8 = 128; [L24] signed short int var_1_9 = -1; [L25] signed short int var_1_10 = 1; [L26] signed char var_1_12 = 0; [L27] unsigned char var_1_13 = 1; [L28] signed char var_1_14 = 2; [L29] double var_1_15 = 1.8; [L30] double var_1_16 = 25.8; [L31] double var_1_17 = 5.5; [L32] double var_1_18 = 4.3; [L33] double var_1_19 = 500.7; [L34] double var_1_20 = 127.5; [L35] double var_1_21 = 1.5; [L36] double var_1_22 = 99.84; [L37] unsigned short int var_1_23 = 4; [L38] signed char var_1_24 = -64; VAL [isInitial=0, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=128, var_1_9=-1] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L62] var_1_8 = __VERIFIER_nondet_long() [L63] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L63] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L64] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L64] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L65] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L65] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=-1] [L66] var_1_9 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L67] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L69] var_1_10 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L70] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L71] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L72] var_1_13 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L73] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L74] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=2, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L75] var_1_14 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L77] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_16=129/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L78] var_1_16 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L79] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_17=11/2, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L80] var_1_17 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L81] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_18=43/10, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L82] var_1_18 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L83] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_19=5007/10, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L84] var_1_19 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L85] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_20=255/2, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L86] var_1_20 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L87] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_21=3/2, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L88] var_1_21 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L89] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_1=256, var_1_22=2496/25, var_1_23=4, var_1_24=-64, var_1_8=2, var_1_9=0] [L102] RET updateVariables() [L103] CALL step() [L42] var_1_22 = var_1_19 [L43] var_1_23 = var_1_10 [L44] var_1_24 = var_1_14 [L45] unsigned char stepLocal_0 = var_1_23 <= var_1_24; VAL [isInitial=1, stepLocal_0=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_19=2, var_1_1=256, var_1_22=2, var_1_23=0, var_1_24=1, var_1_8=2, var_1_9=0] [L46] COND TRUE var_1_13 || stepLocal_0 [L47] var_1_12 = ((((1 - var_1_14) < 0 ) ? -(1 - var_1_14) : (1 - var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_19=2, var_1_1=256, var_1_22=2, var_1_23=0, var_1_24=1, var_1_8=2, var_1_9=0] [L51] signed short int stepLocal_1 = var_1_10; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=9/5, var_1_19=2, var_1_1=256, var_1_22=2, var_1_23=0, var_1_24=1, var_1_8=2, var_1_9=0] [L52] COND TRUE stepLocal_1 <= (var_1_23 / var_1_8) [L53] var_1_15 = ((((((((((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) > (var_1_18)) ? (((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) : (var_1_18)))) < (((((3.6) > (var_1_19)) ? (3.6) : (var_1_19))))) ? (((((((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) > (var_1_18)) ? (((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) : (var_1_18)))) : (((((3.6) > (var_1_19)) ? (3.6) : (var_1_19)))))) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=3, var_1_16=3, var_1_17=0, var_1_18=0, var_1_19=2, var_1_1=256, var_1_22=2, var_1_23=0, var_1_24=1, var_1_8=2, var_1_9=0] [L57] COND TRUE (((((var_1_23 - var_1_23)) > (var_1_12)) ? ((var_1_23 - var_1_23)) : (var_1_12))) <= (((((var_1_23 - var_1_23)) < ((var_1_24 % var_1_8))) ? ((var_1_23 - var_1_23)) : ((var_1_24 % var_1_8)))) [L58] var_1_1 = (((((var_1_9 - var_1_10)) < (var_1_12)) ? ((var_1_9 - var_1_10)) : (var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=3, var_1_16=3, var_1_17=0, var_1_18=0, var_1_19=2, var_1_1=0, var_1_22=2, var_1_23=0, var_1_24=1, var_1_8=2, var_1_9=0] [L103] RET step() [L104] CALL, EXPR property() [L94-L95] return (((((((((((var_1_23 - var_1_23)) > (var_1_12)) ? ((var_1_23 - var_1_23)) : (var_1_12))) <= (((((var_1_23 - var_1_23)) < ((var_1_24 % var_1_8))) ? ((var_1_23 - var_1_23)) : ((var_1_24 % var_1_8))))) ? (var_1_1 == ((signed short int) (((((var_1_9 - var_1_10)) < (var_1_12)) ? ((var_1_9 - var_1_10)) : (var_1_12))))) : 1) && ((var_1_13 || (var_1_23 <= var_1_24)) ? (var_1_12 == ((signed char) ((((1 - var_1_14) < 0 ) ? -(1 - var_1_14) : (1 - var_1_14))))) : (var_1_12 == ((signed char) var_1_14)))) && ((var_1_10 <= (var_1_23 / var_1_8)) ? (var_1_15 == ((double) ((((((((((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) > (var_1_18)) ? (((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) : (var_1_18)))) < (((((3.6) > (var_1_19)) ? (3.6) : (var_1_19))))) ? (((((((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) > (var_1_18)) ? (((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) : (var_1_18)))) : (((((3.6) > (var_1_19)) ? (3.6) : (var_1_19)))))))) : (var_1_15 == ((double) (var_1_20 - var_1_21))))) && (var_1_22 == ((double) var_1_19))) && (var_1_23 == ((unsigned short int) var_1_10))) && (var_1_24 == ((signed char) var_1_14)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=3, var_1_16=3, var_1_17=0, var_1_18=0, var_1_19=2, var_1_1=0, var_1_22=2, var_1_23=0, var_1_24=1, var_1_8=2, var_1_9=0] [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=3, var_1_16=3, var_1_17=0, var_1_18=0, var_1_19=2, var_1_1=0, var_1_22=2, var_1_23=0, var_1_24=1, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_15=3, var_1_16=3, var_1_17=0, var_1_18=0, var_1_19=2, var_1_1=0, var_1_22=2, var_1_23=0, var_1_24=1, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 66 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 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-04 00:59:00,727 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_variablewrapping_normal_file-80.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 1afef333d2d5ce937d4e371f5893af89013ff82bbfaa9da10d02f3a397c05cb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:59:02,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:59:02,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:59:02,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:59:02,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:59:02,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:59:02,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:59:02,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:59:02,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:59:02,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:59:02,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:59:02,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:59:02,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:59:02,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:59:02,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:59:02,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:59:02,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:59:02,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:59:02,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:59:02,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:59:02,653 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 -> 1afef333d2d5ce937d4e371f5893af89013ff82bbfaa9da10d02f3a397c05cb5 [2025-03-04 00:59:02,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:59:02,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:59:02,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:59:02,901 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:59:02,901 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:59:02,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-80.i [2025-03-04 00:59:04,055 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9a02ce2/3077c112b1a1405ab913a87da6a064a9/FLAG8b87fab46 [2025-03-04 00:59:04,236 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:59:04,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-80.i [2025-03-04 00:59:04,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9a02ce2/3077c112b1a1405ab913a87da6a064a9/FLAG8b87fab46 [2025-03-04 00:59:04,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9a02ce2/3077c112b1a1405ab913a87da6a064a9 [2025-03-04 00:59:04,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:59:04,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:59:04,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:59:04,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:59:04,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:59:04,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7109f51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04, skipping insertion in model container [2025-03-04 00:59:04,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:59:04,364 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_variablewrapping_normal_file-80.i[913,926] [2025-03-04 00:59:04,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:59:04,403 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:59:04,410 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_variablewrapping_normal_file-80.i[913,926] [2025-03-04 00:59:04,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:59:04,437 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:59:04,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04 WrapperNode [2025-03-04 00:59:04,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:59:04,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:59:04,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:59:04,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:59:04,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,465 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-04 00:59:04,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:59:04,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:59:04,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:59:04,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:59:04,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,482 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-04 00:59:04,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:59:04,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:59:04,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:59:04,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:59:04,501 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (1/1) ... [2025-03-04 00:59:04,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:59:04,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:59:04,525 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-04 00:59:04,527 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-04 00:59:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:59:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:59:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:59:04,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:59:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:59:04,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:59:04,596 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:59:04,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:59:05,607 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:59:05,607 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:59:05,617 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:59:05,617 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:59:05,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:59:05 BoogieIcfgContainer [2025-03-04 00:59:05,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:59:05,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:59:05,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:59:05,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:59:05,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:59:04" (1/3) ... [2025-03-04 00:59:05,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38638808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:59:05, skipping insertion in model container [2025-03-04 00:59:05,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:59:04" (2/3) ... [2025-03-04 00:59:05,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38638808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:59:05, skipping insertion in model container [2025-03-04 00:59:05,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:59:05" (3/3) ... [2025-03-04 00:59:05,626 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-80.i [2025-03-04 00:59:05,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:59:05,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-80.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:59:05,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:59:05,677 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;@45717370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:59:05,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:59:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 00:59:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 00:59:05,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:05,686 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:59:05,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:05,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:05,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2106099896, now seen corresponding path program 1 times [2025-03-04 00:59:05,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:59:05,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469976184] [2025-03-04 00:59:05,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:05,699 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-04 00:59:05,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:59:05,702 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-04 00:59:05,703 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-04 00:59:05,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 00:59:05,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 00:59:05,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:05,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:05,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:59:05,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:59:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-04 00:59:06,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:59:06,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:59:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469976184] [2025-03-04 00:59:06,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469976184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:59:06,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:59:06,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:59:06,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246157393] [2025-03-04 00:59:06,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:59:06,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:59:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:59:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:59:06,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:59:06,028 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 00:59:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:06,041 INFO L93 Difference]: Finished difference Result 94 states and 154 transitions. [2025-03-04 00:59:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:59:06,042 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2025-03-04 00:59:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:06,047 INFO L225 Difference]: With dead ends: 94 [2025-03-04 00:59:06,047 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 00:59:06,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-04 00:59:06,053 INFO L435 NwaCegarLoop]: 66 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, 66 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-04 00:59:06,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:59:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 00:59:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 00:59:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 00:59:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-04 00:59:06,085 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 109 [2025-03-04 00:59:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:06,086 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-04 00:59:06,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 00:59:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-04 00:59:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 00:59:06,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:06,089 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:59:06,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:59:06,290 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-04 00:59:06,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:06,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:06,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1574967247, now seen corresponding path program 1 times [2025-03-04 00:59:06,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:59:06,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504435817] [2025-03-04 00:59:06,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:06,292 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-04 00:59:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:59:06,294 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-04 00:59:06,295 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-04 00:59:06,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 00:59:06,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 00:59:06,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:06,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:06,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 00:59:06,619 INFO L279 TraceCheckSpWp]: Computing forward predicates...