./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-16.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-16.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 13c8c8fb2a848ec9a9bd5e56f712fb4656339c11d6a7907cbd93e2a606641c6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:06:25,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:06:26,024 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:06:26,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:06:26,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:06:26,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:06:26,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:06:26,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:06:26,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:06:26,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:06:26,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:06:26,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:06:26,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:06:26,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:06:26,044 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:06:26,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:06:26,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:06:26,044 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:06:26,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:06:26,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:06:26,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:06:26,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:06:26,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:06:26,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:06:26,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:06:26,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:06:26,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:06:26,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:06:26,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:06:26,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:06:26,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:06:26,047 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 -> 13c8c8fb2a848ec9a9bd5e56f712fb4656339c11d6a7907cbd93e2a606641c6c [2025-01-09 15:06:26,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:06:26,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:06:26,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:06:26,299 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:06:26,299 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:06:26,300 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-16.i [2025-01-09 15:06:27,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac6492efe/c07aaf94ef7848028330aa358a6230e8/FLAGb132f0ebd [2025-01-09 15:06:27,812 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:06:27,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-16.i [2025-01-09 15:06:27,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac6492efe/c07aaf94ef7848028330aa358a6230e8/FLAGb132f0ebd [2025-01-09 15:06:27,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac6492efe/c07aaf94ef7848028330aa358a6230e8 [2025-01-09 15:06:27,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:06:27,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:06:27,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:06:27,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:06:27,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:06:27,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:06:27" (1/1) ... [2025-01-09 15:06:27,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c2d6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:27, skipping insertion in model container [2025-01-09 15:06:27,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:06:27" (1/1) ... [2025-01-09 15:06:27,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:06:27,974 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-16.i[913,926] [2025-01-09 15:06:28,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:06:28,021 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:06:28,032 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-16.i[913,926] [2025-01-09 15:06:28,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:06:28,070 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:06:28,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28 WrapperNode [2025-01-09 15:06:28,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:06:28,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:06:28,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:06:28,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:06:28,081 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:06:28" (1/1) ... [2025-01-09 15:06:28,087 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:06:28" (1/1) ... [2025-01-09 15:06:28,102 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-01-09 15:06:28,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:06:28,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:06:28,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:06:28,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:06:28,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,119 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:06:28,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:06:28,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:06:28,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:06:28,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:06:28,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (1/1) ... [2025-01-09 15:06:28,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:06:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:06:28,157 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:06:28,159 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:06:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:06:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:06:28,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:06:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:06:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:06:28,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:06:28,229 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:06:28,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:06:28,414 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 15:06:28,414 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:06:28,424 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:06:28,424 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:06:28,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:06:28 BoogieIcfgContainer [2025-01-09 15:06:28,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:06:28,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:06:28,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:06:28,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:06:28,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:06:27" (1/3) ... [2025-01-09 15:06:28,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193a881c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:06:28, skipping insertion in model container [2025-01-09 15:06:28,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:28" (2/3) ... [2025-01-09 15:06:28,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193a881c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:06:28, skipping insertion in model container [2025-01-09 15:06:28,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:06:28" (3/3) ... [2025-01-09 15:06:28,437 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-16.i [2025-01-09 15:06:28,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:06:28,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-16.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:06:28,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:06:28,516 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;@43128a4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:06:28,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:06:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:06:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:06:28,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:06:28,528 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:28,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:06:28,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:06:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1563253760, now seen corresponding path program 1 times [2025-01-09 15:06:28,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:06:28,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003075314] [2025-01-09 15:06:28,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:06:28,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:06:28,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:06:28,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:06:28,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:06:28,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:06:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 15:06:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:06:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003075314] [2025-01-09 15:06:28,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003075314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:06:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400160279] [2025-01-09 15:06:28,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:06:28,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:06:28,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:06:28,706 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:06:28,707 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:06:28,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:06:28,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:06:28,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:06:28,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:06:28,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:06:28,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:06:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 15:06:28,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:06:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400160279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:06:28,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:06:28,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:06:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353096811] [2025-01-09 15:06:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:06:28,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:06:28,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:06:28,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:06:28,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:06:28,845 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:06:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:06:28,860 INFO L93 Difference]: Finished difference Result 108 states and 186 transitions. [2025-01-09 15:06:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:06:28,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2025-01-09 15:06:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:06:28,865 INFO L225 Difference]: With dead ends: 108 [2025-01-09 15:06:28,865 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 15:06:28,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:06:28,868 INFO L435 NwaCegarLoop]: 80 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, 80 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:06:28,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:06:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 15:06:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 15:06:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:06:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2025-01-09 15:06:28,892 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 129 [2025-01-09 15:06:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:06:28,892 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2025-01-09 15:06:28,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:06:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2025-01-09 15:06:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:06:28,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:06:28,896 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:28,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:06:29,096 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:06:29,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:06:29,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:06:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -594705414, now seen corresponding path program 1 times [2025-01-09 15:06:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:06:29,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169633314] [2025-01-09 15:06:29,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:06:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:06:29,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:06:29,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:06:29,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:06:29,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:06:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-01-09 15:06:30,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:06:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169633314] [2025-01-09 15:06:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169633314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:06:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111903523] [2025-01-09 15:06:30,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:06:30,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:06:30,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:06:30,400 INFO L229 MonitoredProcess]: Starting monitored process 3 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:06:30,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:06:30,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:06:30,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:06:30,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:06:30,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:06:30,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:06:30,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:06:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 312 proven. 96 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 15:06:31,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:06:50,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111903523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:06:50,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:06:50,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2025-01-09 15:06:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155850626] [2025-01-09 15:06:50,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:06:50,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:06:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:06:50,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:06:50,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2025-01-09 15:06:50,809 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-01-09 15:06:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:06:53,529 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2025-01-09 15:06:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:06:53,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 129 [2025-01-09 15:06:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:06:53,535 INFO L225 Difference]: With dead ends: 175 [2025-01-09 15:06:53,535 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 15:06:53,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=164, Invalid=435, Unknown=1, NotChecked=0, Total=600 [2025-01-09 15:06:53,536 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 61 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:06:53,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 306 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 15:06:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 15:06:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2025-01-09 15:06:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:06:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 15:06:53,569 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 129 [2025-01-09 15:06:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:06:53,570 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 15:06:53,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-01-09 15:06:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 15:06:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:06:53,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:06:53,573 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:53,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:06:53,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:06:53,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:06:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:06:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash 85352956, now seen corresponding path program 1 times [2025-01-09 15:06:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:06:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596280466] [2025-01-09 15:06:53,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:06:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:06:53,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:06:53,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:06:53,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:06:53,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:06:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674873129] [2025-01-09 15:06:53,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:06:53,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:06:53,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:06:53,848 INFO L229 MonitoredProcess]: Starting monitored process 4 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:06:53,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:06:53,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:06:53,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:06:53,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:06:53,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:06:53,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:06:53,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:06:53,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:06:53,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:06:53,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:06:54,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:06:54,002 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:06:54,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:06:54,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:06:54,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:06:54,209 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 15:06:54,326 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:06:54,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:06:54 BoogieIcfgContainer [2025-01-09 15:06:54,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:06:54,329 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:06:54,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:06:54,329 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:06:54,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:06:28" (3/4) ... [2025-01-09 15:06:54,331 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:06:54,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:06:54,332 INFO L158 Benchmark]: Toolchain (without parser) took 26490.42ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.6MB in the beginning and 125.2MB in the end (delta: -2.6MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2025-01-09 15:06:54,332 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:06:54,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.33ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 109.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:06:54,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.28ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:06:54,333 INFO L158 Benchmark]: Boogie Preprocessor took 23.97ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:06:54,334 INFO L158 Benchmark]: RCFGBuilder took 297.09ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:06:54,334 INFO L158 Benchmark]: TraceAbstraction took 25902.32ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 88.9MB in the beginning and 125.3MB in the end (delta: -36.4MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2025-01-09 15:06:54,335 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 293.6MB. Free memory was 125.3MB in the beginning and 125.2MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:06:54,335 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.19ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.33ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 109.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.28ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.97ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 297.09ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25902.32ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 88.9MB in the beginning and 125.3MB in the end (delta: -36.4MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 293.6MB. Free memory was 125.3MB in the beginning and 125.2MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_3 = 4; [L24] signed short int var_1_4 = 256; [L25] unsigned char var_1_5 = 0; [L26] unsigned char var_1_6 = 1; [L27] float var_1_7 = 1000000.8; [L28] float var_1_8 = 3.8; [L29] signed char var_1_9 = 25; [L30] float var_1_10 = 2.75; [L31] signed char var_1_11 = 0; [L32] signed char var_1_12 = 32; [L33] signed char var_1_13 = 2; [L34] signed char var_1_14 = 2; [L35] signed short int var_1_15 = -32; [L36] signed char last_1_var_1_9 = 25; VAL [isInitial=0, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=4, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L107] isInitial = 1 [L108] FCALL initially() [L110] CALL updateLastVariables() [L100] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=4, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L69] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L69] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L70] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L70] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=256, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L71] var_1_4 = __VERIFIER_nondet_short() [L72] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L72] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L73] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L74] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=0, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L76] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L77] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L77] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L79] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L80] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L80] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_8=19/5, var_1_9=25] [L81] var_1_8 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L82] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=25, var_1_10=11/4, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L83] var_1_10 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L84] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L85] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L85] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=32, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L90] RET assume_abort_if_not(var_1_12 >= 31) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=2, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L92] var_1_13 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L93] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L94] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L94] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=2, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L95] var_1_14 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L96] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L97] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L97] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L111] RET updateVariables() [L112] CALL step() [L40] COND FALSE !((last_1_var_1_9 % ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) <= -1000000) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=5000004/5, var_1_9=25] [L43] var_1_7 = var_1_8 [L44] signed char stepLocal_2 = var_1_11; [L45] unsigned char stepLocal_1 = 99999.375 <= var_1_10; VAL [isInitial=1, last_1_var_1_9=25, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-32, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L46] COND FALSE !(var_1_13 <= stepLocal_2) [L51] var_1_15 = -25 VAL [isInitial=1, last_1_var_1_9=25, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L53] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_9=25, stepLocal_0=1, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L54] COND FALSE !(var_1_8 < (var_1_7 / var_1_10)) VAL [isInitial=1, last_1_var_1_9=25, stepLocal_0=1, stepLocal_1=1, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((((last_1_var_1_9 % ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) <= -1000000) ? (var_1_1 == ((unsigned char) (var_1_5 || var_1_6))) : 1) && (var_1_7 == ((float) var_1_8))) && ((var_1_8 < (var_1_7 / var_1_10)) ? ((var_1_1 || var_1_6) ? (var_1_9 == ((signed char) ((((((var_1_11) > (5)) ? (var_1_11) : (5))) + (var_1_12 - var_1_13)) - var_1_14))) : ((var_1_10 > var_1_8) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_12)))) : 1)) && ((var_1_13 <= var_1_11) ? (((var_1_8 < var_1_7) && (99999.375 <= var_1_10)) ? (var_1_15 == ((signed short int) (var_1_13 + var_1_14))) : 1) : (var_1_15 == ((signed short int) -25))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=25, var_1_11=0, var_1_12=31, var_1_13=1, var_1_14=0, var_1_15=-25, var_1_1=1, var_1_3=26, var_1_4=-1, var_1_5=1, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 386 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 138 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 1955 SizeOfPredicates, 4 NumberOfNonLiveVariables, 584 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3128/3360 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:06:54,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-16.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 13c8c8fb2a848ec9a9bd5e56f712fb4656339c11d6a7907cbd93e2a606641c6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:06:56,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:06:56,216 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:06:56,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:06:56,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:06:56,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:06:56,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:06:56,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:06:56,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:06:56,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:06:56,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:06:56,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:06:56,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:06:56,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:06:56,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:06:56,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:06:56,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:06:56,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:06:56,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:06:56,287 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 -> 13c8c8fb2a848ec9a9bd5e56f712fb4656339c11d6a7907cbd93e2a606641c6c [2025-01-09 15:06:56,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:06:56,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:06:56,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:06:56,540 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:06:56,541 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:06:56,541 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-16.i [2025-01-09 15:06:57,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee472a19/90996eac3df94d9eb1ce782f3267620c/FLAGde8d59a35 [2025-01-09 15:06:58,003 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:06:58,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-16.i [2025-01-09 15:06:58,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee472a19/90996eac3df94d9eb1ce782f3267620c/FLAGde8d59a35 [2025-01-09 15:06:58,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee472a19/90996eac3df94d9eb1ce782f3267620c [2025-01-09 15:06:58,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:06:58,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:06:58,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:06:58,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:06:58,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:06:58,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335d2b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58, skipping insertion in model container [2025-01-09 15:06:58,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:06:58,176 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-16.i[913,926] [2025-01-09 15:06:58,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:06:58,239 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:06:58,248 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-16.i[913,926] [2025-01-09 15:06:58,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:06:58,288 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:06:58,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58 WrapperNode [2025-01-09 15:06:58,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:06:58,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:06:58,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:06:58,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:06:58,295 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:06:58" (1/1) ... [2025-01-09 15:06:58,306 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:06:58" (1/1) ... [2025-01-09 15:06:58,323 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-01-09 15:06:58,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:06:58,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:06:58,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:06:58,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:06:58,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,350 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:06:58,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:06:58,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:06:58,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:06:58,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:06:58,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (1/1) ... [2025-01-09 15:06:58,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:06:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:06:58,395 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:06:58,399 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:06:58,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:06:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:06:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:06:58,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:06:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:06:58,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:06:58,472 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:06:58,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:07:00,107 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 15:07:00,108 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:07:00,113 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:07:00,114 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:07:00,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:00 BoogieIcfgContainer [2025-01-09 15:07:00,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:07:00,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:07:00,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:07:00,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:07:00,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:06:58" (1/3) ... [2025-01-09 15:07:00,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2e7e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:07:00, skipping insertion in model container [2025-01-09 15:07:00,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:06:58" (2/3) ... [2025-01-09 15:07:00,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2e7e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:07:00, skipping insertion in model container [2025-01-09 15:07:00,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:07:00" (3/3) ... [2025-01-09 15:07:00,120 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-16.i [2025-01-09 15:07:00,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:07:00,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-16.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:07:00,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:07:00,175 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;@62b672aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:07:00,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:07:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:07:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:07:00,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:07:00,185 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:00,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:07:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:07:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1563253760, now seen corresponding path program 1 times [2025-01-09 15:07:00,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:07:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002108811] [2025-01-09 15:07:00,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:00,198 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:07:00,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:07:00,208 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:07:00,212 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:07:00,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:07:00,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:07:00,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:00,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:07:00,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:07:00,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:07:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-01-09 15:07:00,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:07:00,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:07:00,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002108811] [2025-01-09 15:07:00,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002108811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:07:00,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:07:00,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:07:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730935662] [2025-01-09 15:07:00,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:07:00,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:07:00,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:07:00,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:07:00,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:07:00,597 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:07:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:07:00,617 INFO L93 Difference]: Finished difference Result 108 states and 186 transitions. [2025-01-09 15:07:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:07:00,619 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2025-01-09 15:07:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:07:00,623 INFO L225 Difference]: With dead ends: 108 [2025-01-09 15:07:00,623 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 15:07:00,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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:07:00,626 INFO L435 NwaCegarLoop]: 79 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, 79 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:07:00,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:07:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 15:07:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 15:07:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:07:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2025-01-09 15:07:00,664 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 129 [2025-01-09 15:07:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:07:00,664 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2025-01-09 15:07:00,665 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:07:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2025-01-09 15:07:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:07:00,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:07:00,667 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:00,680 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 15:07:00,872 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:07:00,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:07:00,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:07:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash 85352956, now seen corresponding path program 1 times [2025-01-09 15:07:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:07:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340328123] [2025-01-09 15:07:00,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:07:00,874 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:07:00,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:07:00,877 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:07:00,882 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:07:00,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:07:01,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:07:01,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:07:01,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:07:01,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:07:01,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:07:28,888 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)