./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:11:21,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:11:21,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:11:21,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:11:21,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:11:21,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:11:21,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:11:21,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:11:21,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:11:21,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:11:21,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:11:21,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:11:21,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:11:21,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:11:21,624 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:11:21,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:11:21,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:11:21,625 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:11:21,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:11:21,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:11:21,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:11:21,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:11:21,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:21,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:11:21,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:21,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:11:21,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:11:21,627 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-jdk21/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 -> 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 [2025-01-09 15:11:21,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:11:21,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:11:21,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:11:21,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:11:21,858 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:11:21,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2025-01-09 15:11:23,008 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa508122c/60a23316a9884fb3a63a4e78d0d964d1/FLAG739c1a713 [2025-01-09 15:11:23,272 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:11:23,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2025-01-09 15:11:23,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa508122c/60a23316a9884fb3a63a4e78d0d964d1/FLAG739c1a713 [2025-01-09 15:11:23,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa508122c/60a23316a9884fb3a63a4e78d0d964d1 [2025-01-09 15:11:23,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:11:23,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:11:23,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:11:23,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:11:23,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:11:23,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3137b067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23, skipping insertion in model container [2025-01-09 15:11:23,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:11:23,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i[913,926] [2025-01-09 15:11:23,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:11:23,746 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:11:23,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i[913,926] [2025-01-09 15:11:23,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:11:23,793 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:11:23,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23 WrapperNode [2025-01-09 15:11:23,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:11:23,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:11:23,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:11:23,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:11:23,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,829 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-01-09 15:11:23,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:11:23,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:11:23,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:11:23,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:11:23,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,857 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-01-09 15:11:23,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:11:23,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:11:23,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:11:23,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:11:23,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (1/1) ... [2025-01-09 15:11:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:23,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:11:23,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:11:23,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:11:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:11:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:11:23,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:11:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:11:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:11:23,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:11:23,991 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:11:23,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:11:24,210 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 15:11:24,212 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:11:24,219 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:11:24,219 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:11:24,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:11:24 BoogieIcfgContainer [2025-01-09 15:11:24,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:11:24,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:11:24,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:11:24,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:11:24,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:11:23" (1/3) ... [2025-01-09 15:11:24,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2b7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:11:24, skipping insertion in model container [2025-01-09 15:11:24,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:23" (2/3) ... [2025-01-09 15:11:24,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2b7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:11:24, skipping insertion in model container [2025-01-09 15:11:24,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:11:24" (3/3) ... [2025-01-09 15:11:24,228 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-52.i [2025-01-09 15:11:24,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:11:24,249 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-52.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:11:24,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:11:24,296 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;@d768619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:11:24,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:11:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:11:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:11:24,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:11:24,306 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:11:24,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:11:24,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:11:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2025675995, now seen corresponding path program 1 times [2025-01-09 15:11:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:11:24,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436507345] [2025-01-09 15:11:24,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:11:24,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:11:24,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:11:24,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:24,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:11:24,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:11:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436507345] [2025-01-09 15:11:24,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436507345] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:11:24,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289115401] [2025-01-09 15:11:24,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:24,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:11:24,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:11:24,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:11:24,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:11:24,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:11:24,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:11:24,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:24,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:24,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:11:24,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:11:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:11:24,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:11:24,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289115401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:11:24,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:11:24,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:11:24,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750219713] [2025-01-09 15:11:24,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:11:24,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:11:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:11:24,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:11:24,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:11:24,751 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:11:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:11:24,772 INFO L93 Difference]: Finished difference Result 118 states and 195 transitions. [2025-01-09 15:11:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:11:24,774 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-01-09 15:11:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:11:24,779 INFO L225 Difference]: With dead ends: 118 [2025-01-09 15:11:24,780 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 15:11:24,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-01-09 15:11:24,784 INFO L435 NwaCegarLoop]: 86 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, 86 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-01-09 15:11:24,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:11:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 15:11:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 15:11:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:11:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-01-09 15:11:24,809 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 116 [2025-01-09 15:11:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:11:24,809 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-01-09 15:11:24,810 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:11:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-01-09 15:11:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:11:24,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:11:24,812 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:11:24,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:11:25,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:11:25,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:11:25,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:11:25,017 INFO L85 PathProgramCache]: Analyzing trace with hash -658779923, now seen corresponding path program 1 times [2025-01-09 15:11:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:11:25,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784844425] [2025-01-09 15:11:25,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:11:25,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:11:25,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:11:25,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:25,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:11:25,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:11:25,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:11:25,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:11:25,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:25,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:11:25,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:11:25,235 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:11:25,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:11:25,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:11:25,239 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 15:11:25,306 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:11:25,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:11:25 BoogieIcfgContainer [2025-01-09 15:11:25,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:11:25,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:11:25,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:11:25,309 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:11:25,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:11:24" (3/4) ... [2025-01-09 15:11:25,311 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:11:25,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:11:25,312 INFO L158 Benchmark]: Toolchain (without parser) took 1738.25ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 118.1MB in the end (delta: 12.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2025-01-09 15:11:25,312 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:11:25,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.17ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 117.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:11:25,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.80ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 116.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:11:25,313 INFO L158 Benchmark]: Boogie Preprocessor took 39.67ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 114.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:11:25,313 INFO L158 Benchmark]: RCFGBuilder took 345.77ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 97.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:11:25,314 INFO L158 Benchmark]: TraceAbstraction took 1087.26ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 118.1MB in the end (delta: -21.6MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-01-09 15:11:25,314 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 118.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:11:25,315 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.71ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.17ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 117.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.80ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 116.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.67ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 114.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.77ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 97.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1087.26ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 118.1MB in the end (delta: -21.6MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 118.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_3 = 32; [L24] signed short int var_1_4 = -1; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] double var_1_10 = 25.7; [L31] double var_1_11 = 256.5; [L32] double var_1_12 = 0.0; [L33] double var_1_13 = 31.1; [L34] double var_1_14 = 256.6; [L35] unsigned long int var_1_15 = 8; [L36] unsigned char var_1_16 = 16; VAL [isInitial=0, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=32, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L102] isInitial = 1 [L103] FCALL initially() [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_4 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] var_1_16 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_16 <= 30) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_16 <= 30) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L40] signed short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L41] COND FALSE !(stepLocal_0 > ((var_1_4 / -256) * 32)) [L48] var_1_5 = var_1_9 VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L50] COND TRUE \read(var_1_7) [L51] var_1_10 = (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L53] COND TRUE var_1_10 < 63.75 [L54] var_1_1 = (10 - var_1_3) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L58] COND FALSE !(! (var_1_13 < (127.125 / var_1_12))) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((double) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L98-L99] return ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((double) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=-257, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 86 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, 86 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:11:25,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:11:27,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:11:27,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:11:27,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:11:27,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:11:27,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:11:27,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:11:27,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:11:27,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:11:27,501 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:11:27,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:11:27,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:11:27,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:11:27,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:11:27,503 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:11:27,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:11:27,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:11:27,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:11:27,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:11:27,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:11:27,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:11:27,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:11:27,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:11:27,506 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:11:27,506 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:11:27,506 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:11:27,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:11:27,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:11:27,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:11:27,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:11:27,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:11:27,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:11:27,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:11:27,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:11:27,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:27,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:11:27,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:11:27,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:11:27,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:11:27,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:27,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:11:27,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:11:27,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:11:27,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:11:27,508 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:11:27,508 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:11:27,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:11:27,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:11:27,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:11:27,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:11:27,509 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-jdk21/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 -> 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 [2025-01-09 15:11:27,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:11:27,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:11:27,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:11:27,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:11:27,759 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:11:27,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2025-01-09 15:11:28,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1608542aa/663cbfb0e7874e8faa9a623e1eb77c66/FLAG100c4eb6a [2025-01-09 15:11:29,149 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:11:29,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2025-01-09 15:11:29,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1608542aa/663cbfb0e7874e8faa9a623e1eb77c66/FLAG100c4eb6a [2025-01-09 15:11:29,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1608542aa/663cbfb0e7874e8faa9a623e1eb77c66 [2025-01-09 15:11:29,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:11:29,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:11:29,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:11:29,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:11:29,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:11:29,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5537f08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29, skipping insertion in model container [2025-01-09 15:11:29,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:11:29,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i[913,926] [2025-01-09 15:11:29,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:11:29,681 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:11:29,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i[913,926] [2025-01-09 15:11:29,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:11:29,726 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:11:29,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29 WrapperNode [2025-01-09 15:11:29,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:11:29,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:11:29,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:11:29,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:11:29,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,759 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-01-09 15:11:29,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:11:29,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:11:29,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:11:29,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:11:29,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,781 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-01-09 15:11:29,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:11:29,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:11:29,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:11:29,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:11:29,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (1/1) ... [2025-01-09 15:11:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:11:29,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:11:29,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:11:29,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:11:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:11:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:11:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:11:29,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:11:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:11:29,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:11:29,912 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:11:29,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:11:42,345 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:11:42,345 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:11:42,351 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:11:42,352 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:11:42,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:11:42 BoogieIcfgContainer [2025-01-09 15:11:42,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:11:42,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:11:42,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:11:42,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:11:42,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:11:29" (1/3) ... [2025-01-09 15:11:42,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6f41cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:11:42, skipping insertion in model container [2025-01-09 15:11:42,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:11:29" (2/3) ... [2025-01-09 15:11:42,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6f41cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:11:42, skipping insertion in model container [2025-01-09 15:11:42,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:11:42" (3/3) ... [2025-01-09 15:11:42,359 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-52.i [2025-01-09 15:11:42,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:11:42,369 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-52.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:11:42,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:11:42,408 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;@1c67f15d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:11:42,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:11:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:11:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:11:42,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:11:42,434 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:11:42,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:11:42,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:11:42,438 INFO L85 PathProgramCache]: Analyzing trace with hash -499783370, now seen corresponding path program 1 times [2025-01-09 15:11:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:11:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393849020] [2025-01-09 15:11:42,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:42,445 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-01-09 15:11:42,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:11:42,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 15:11:42,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:11:42,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:11:43,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:11:43,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:43,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:11:43,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:11:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 15:11:43,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:11:43,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:11:43,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393849020] [2025-01-09 15:11:43,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393849020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:11:43,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:11:43,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:11:43,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765911811] [2025-01-09 15:11:43,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:11:43,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:11:43,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:11:43,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:11:43,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:11:43,272 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:11:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:11:43,288 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-01-09 15:11:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:11:43,290 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2025-01-09 15:11:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:11:43,293 INFO L225 Difference]: With dead ends: 100 [2025-01-09 15:11:43,294 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 15:11:43,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-01-09 15:11:43,301 INFO L435 NwaCegarLoop]: 73 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, 73 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-01-09 15:11:43,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:11:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 15:11:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 15:11:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:11:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-01-09 15:11:43,329 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 114 [2025-01-09 15:11:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:11:43,329 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-01-09 15:11:43,329 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:11:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-01-09 15:11:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:11:43,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:11:43,331 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:11:43,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:11:43,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 15:11:43,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:11:43,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:11:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1244653822, now seen corresponding path program 1 times [2025-01-09 15:11:43,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:11:43,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340395712] [2025-01-09 15:11:43,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:43,533 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-01-09 15:11:43,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:11:43,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 15:11:43,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:11:43,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:11:44,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:11:44,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:44,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:44,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 15:11:44,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:12:22,346 WARN L286 SmtUtils]: Spent 11.98s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)