./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:12:53,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:12:53,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:12:53,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:12:53,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:12:53,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:12:53,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:12:53,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:12:53,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:12:53,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:12:53,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:12:53,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:12:53,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:12:53,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:12:53,201 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:12:53,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:12:53,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:12:53,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:12:53,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:12:53,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:12:53,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:12:53,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:12:53,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:12:53,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:12:53,205 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:12:53,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:12:53,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:12:53,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:12:53,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:12:53,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:12:53,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:12:53,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:12:53,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:12:53,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:12:53,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:12:53,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:12:53,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:12:53,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:12:53,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:12:53,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:12:53,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:12:53,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:12:53,210 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 [2024-10-14 13:12:53,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:12:53,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:12:53,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:12:53,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:12:53,429 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:12:53,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-10-14 13:12:54,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:12:54,970 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:12:54,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-10-14 13:12:54,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90fda230/43e145db40dc4a269dae0358e8cb51e6/FLAG8bd91edd9 [2024-10-14 13:12:54,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90fda230/43e145db40dc4a269dae0358e8cb51e6 [2024-10-14 13:12:54,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:12:54,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:12:54,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:12:54,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:12:54,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:12:55,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:12:54" (1/1) ... [2024-10-14 13:12:55,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae63ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55, skipping insertion in model container [2024-10-14 13:12:55,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:12:54" (1/1) ... [2024-10-14 13:12:55,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:12:55,157 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2024-10-14 13:12:55,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:12:55,196 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:12:55,205 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2024-10-14 13:12:55,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:12:55,233 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:12:55,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55 WrapperNode [2024-10-14 13:12:55,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:12:55,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:12:55,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:12:55,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:12:55,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,266 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-10-14 13:12:55,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:12:55,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:12:55,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:12:55,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:12:55,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,290 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]. [2024-10-14 13:12:55,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:12:55,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:12:55,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:12:55,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:12:55,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (1/1) ... [2024-10-14 13:12:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:12:55,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:12:55,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:12:55,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:12:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:12:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:12:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:12:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:12:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:12:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:12:55,467 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:12:55,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:12:55,698 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 13:12:55,699 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:12:55,733 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:12:55,734 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:12:55,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:12:55 BoogieIcfgContainer [2024-10-14 13:12:55,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:12:55,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:12:55,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:12:55,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:12:55,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:12:54" (1/3) ... [2024-10-14 13:12:55,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bff56ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:12:55, skipping insertion in model container [2024-10-14 13:12:55,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:12:55" (2/3) ... [2024-10-14 13:12:55,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bff56ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:12:55, skipping insertion in model container [2024-10-14 13:12:55,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:12:55" (3/3) ... [2024-10-14 13:12:55,746 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-31.i [2024-10-14 13:12:55,764 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:12:55,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:12:55,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:12:55,842 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;@2cefc68f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:12:55,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:12:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 13:12:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 13:12:55,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:12:55,859 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:12:55,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:12:55,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:12:55,866 INFO L85 PathProgramCache]: Analyzing trace with hash 30954485, now seen corresponding path program 1 times [2024-10-14 13:12:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:12:55,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519323511] [2024-10-14 13:12:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:12:55,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:12:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:12:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:12:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 13:12:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:12:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 13:12:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:12:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:12:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:12:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:12:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 13:12:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 13:12:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:12:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 13:12:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:12:56,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519323511] [2024-10-14 13:12:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519323511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:12:56,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:12:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:12:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102410235] [2024-10-14 13:12:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:12:56,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:12:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:12:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:12:56,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:12:56,349 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 13:12:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:12:56,376 INFO L93 Difference]: Finished difference Result 75 states and 131 transitions. [2024-10-14 13:12:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:12:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-14 13:12:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:12:56,384 INFO L225 Difference]: With dead ends: 75 [2024-10-14 13:12:56,385 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 13:12:56,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:12:56,390 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:12:56,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:12:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 13:12:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-14 13:12:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 13:12:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2024-10-14 13:12:56,422 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 70 [2024-10-14 13:12:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:12:56,423 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2024-10-14 13:12:56,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 13:12:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2024-10-14 13:12:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 13:12:56,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:12:56,426 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:12:56,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:12:56,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:12:56,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:12:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 88212787, now seen corresponding path program 1 times [2024-10-14 13:12:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:12:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182360232] [2024-10-14 13:12:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:12:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:12:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:12:56,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389852041] [2024-10-14 13:12:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:12:56,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:12:56,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:12:56,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:12:56,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:12:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:12:56,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:12:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:12:56,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:12:56,661 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:12:56,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:12:56,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:12:56,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:12:56,868 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 13:12:56,909 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:12:56,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:12:56 BoogieIcfgContainer [2024-10-14 13:12:56,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:12:56,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:12:56,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:12:56,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:12:56,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:12:55" (3/4) ... [2024-10-14 13:12:56,914 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:12:56,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:12:56,916 INFO L158 Benchmark]: Toolchain (without parser) took 1923.23ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 119.9MB in the end (delta: -3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:12:56,916 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:12:56,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.74ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 103.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 13:12:56,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.47ms. Allocated memory is still 186.6MB. Free memory was 103.4MB in the beginning and 100.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:12:56,917 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 186.6MB. Free memory was 100.8MB in the beginning and 98.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:12:56,917 INFO L158 Benchmark]: RCFGBuilder took 432.66ms. Allocated memory is still 186.6MB. Free memory was 98.2MB in the beginning and 79.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 13:12:56,921 INFO L158 Benchmark]: TraceAbstraction took 1172.33ms. Allocated memory is still 186.6MB. Free memory was 78.8MB in the beginning and 119.9MB in the end (delta: -41.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:12:56,921 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 186.6MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:12:56,923 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.12ms. Allocated memory is still 123.7MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.74ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 103.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.47ms. Allocated memory is still 186.6MB. Free memory was 103.4MB in the beginning and 100.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 186.6MB. Free memory was 100.8MB in the beginning and 98.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.66ms. Allocated memory is still 186.6MB. Free memory was 98.2MB in the beginning and 79.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1172.33ms. Allocated memory is still 186.6MB. Free memory was 78.8MB in the beginning and 119.9MB in the end (delta: -41.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 186.6MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] signed long int var_1_7 = 4; [L27] signed long int var_1_8 = -32; [L28] unsigned char var_1_9 = 64; [L29] unsigned char var_1_12 = 4; [L30] double var_1_13 = 0.97; [L31] double var_1_14 = 32.6; [L32] signed long int last_1_var_1_7 = 4; [L33] double last_1_var_1_13 = 0.97; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L92] last_1_var_1_7 = var_1_7 [L93] last_1_var_1_13 = var_1_13 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L76] var_1_3 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L77] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L82] var_1_8 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L83] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L89] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L104] RET updateVariables() [L105] CALL step() [L37] COND FALSE !(! (var_1_3 < (var_1_8 * last_1_var_1_7))) [L44] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=1] [L46] COND FALSE !(var_1_9 < var_1_9) [L49] var_1_7 = (var_1_9 - var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L51] COND FALSE !((var_1_9 + var_1_3) < var_1_9) [L62] var_1_13 = var_1_14 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L64] COND TRUE \read(var_1_2) [L65] var_1_1 = ((var_1_3 - var_1_9) - var_1_9) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_9) - var_1_9))) : ((var_1_6 && (var_1_3 < var_1_9)) ? (var_1_1 == ((signed long int) var_1_3)) : 1)) && ((var_1_9 < var_1_9) ? (var_1_7 == ((signed long int) (var_1_9 + var_1_9))) : (var_1_7 == ((signed long int) (var_1_9 - var_1_3))))) && ((! (var_1_3 < (var_1_8 * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? (var_1_6 ? (var_1_9 == ((unsigned char) var_1_12)) : 1) : 1) : (var_1_9 == ((unsigned char) var_1_12)))) && (((var_1_9 + var_1_3) < var_1_9) ? ((var_1_2 && var_1_6) ? (var_1_6 ? (var_1_13 == ((double) 0.8)) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 52 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 69 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 13:12:56,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:12:58,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:12:58,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:12:58,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:12:58,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:12:58,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:12:58,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:12:58,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:12:58,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:12:58,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:12:58,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:12:58,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:12:58,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:12:58,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:12:58,947 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:12:58,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:12:58,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:12:58,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:12:58,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:12:58,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:12:58,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:12:58,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:12:58,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:12:58,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:12:58,953 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:12:58,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:12:58,953 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:12:58,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:12:58,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:12:58,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:12:58,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:12:58,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:12:58,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:12:58,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:12:58,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:12:58,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:12:58,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:12:58,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:12:58,955 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:12:58,956 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:12:58,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:12:58,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:12:58,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:12:58,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:12:58,957 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:12:58,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 [2024-10-14 13:12:59,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:12:59,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:12:59,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:12:59,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:12:59,247 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:12:59,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-10-14 13:13:00,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:13:00,867 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:13:00,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-10-14 13:13:00,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7689e3159/8ef8a46906354f70b78d685258adc5de/FLAGa9d587921 [2024-10-14 13:13:00,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7689e3159/8ef8a46906354f70b78d685258adc5de [2024-10-14 13:13:00,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:13:00,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:13:00,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:13:00,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:13:00,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:13:00,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:13:00" (1/1) ... [2024-10-14 13:13:00,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be41553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:00, skipping insertion in model container [2024-10-14 13:13:00,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:13:00" (1/1) ... [2024-10-14 13:13:00,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:13:01,091 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2024-10-14 13:13:01,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:13:01,159 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:13:01,172 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2024-10-14 13:13:01,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:13:01,211 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:13:01,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01 WrapperNode [2024-10-14 13:13:01,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:13:01,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:13:01,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:13:01,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:13:01,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,252 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-10-14 13:13:01,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:13:01,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:13:01,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:13:01,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:13:01,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,288 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]. [2024-10-14 13:13:01,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:13:01,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:13:01,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:13:01,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:13:01,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (1/1) ... [2024-10-14 13:13:01,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:13:01,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:13:01,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:13:01,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:13:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:13:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:13:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:13:01,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:13:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:13:01,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:13:01,503 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:13:01,505 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:13:01,750 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 13:13:01,750 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:13:01,819 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:13:01,819 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:13:01,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:13:01 BoogieIcfgContainer [2024-10-14 13:13:01,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:13:01,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:13:01,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:13:01,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:13:01,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:13:00" (1/3) ... [2024-10-14 13:13:01,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d12656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:13:01, skipping insertion in model container [2024-10-14 13:13:01,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:13:01" (2/3) ... [2024-10-14 13:13:01,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d12656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:13:01, skipping insertion in model container [2024-10-14 13:13:01,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:13:01" (3/3) ... [2024-10-14 13:13:01,832 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-31.i [2024-10-14 13:13:01,849 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:13:01,849 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:13:01,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:13:01,924 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;@49fa5441, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:13:01,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:13:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 13:13:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 13:13:01,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:13:01,940 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:13:01,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:13:01,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:13:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash 30954485, now seen corresponding path program 1 times [2024-10-14 13:13:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:13:01,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46322840] [2024-10-14 13:13:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:13:01,961 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 [2024-10-14 13:13:01,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:13:01,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:13:01,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 13:13:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:13:02,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:13:02,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:13:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 13:13:02,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:13:02,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:13:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46322840] [2024-10-14 13:13:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46322840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:13:02,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:13:02,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:13:02,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135758669] [2024-10-14 13:13:02,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:13:02,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:13:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:13:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:13:02,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:13:02,204 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 13:13:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:13:02,247 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2024-10-14 13:13:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:13:02,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-14 13:13:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:13:02,260 INFO L225 Difference]: With dead ends: 74 [2024-10-14 13:13:02,260 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 13:13:02,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:13:02,267 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:13:02,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:13:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 13:13:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-14 13:13:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 13:13:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-14 13:13:02,300 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 70 [2024-10-14 13:13:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:13:02,301 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-14 13:13:02,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 13:13:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-14 13:13:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 13:13:02,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:13:02,304 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:13:02,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 13:13:02,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:13:02,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:13:02,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:13:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 88212787, now seen corresponding path program 1 times [2024-10-14 13:13:02,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:13:02,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241679709] [2024-10-14 13:13:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:13:02,511 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 [2024-10-14 13:13:02,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:13:02,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:13:02,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 13:13:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:13:02,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 13:13:02,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:13:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-14 13:13:35,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:13:35,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:13:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241679709] [2024-10-14 13:13:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241679709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:13:35,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:13:35,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 13:13:35,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912791245] [2024-10-14 13:13:35,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:13:35,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 13:13:35,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:13:35,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 13:13:35,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:13:35,991 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 13:13:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:13:37,041 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2024-10-14 13:13:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 13:13:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-14 13:13:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:13:37,043 INFO L225 Difference]: With dead ends: 104 [2024-10-14 13:13:37,043 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 13:13:37,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2024-10-14 13:13:37,045 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 109 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:13:37,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 193 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:13:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 13:13:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2024-10-14 13:13:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:13:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-14 13:13:37,077 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 70 [2024-10-14 13:13:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:13:37,079 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-14 13:13:37,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 13:13:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-14 13:13:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 13:13:37,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:13:37,086 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:13:37,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 13:13:37,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:13:37,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:13:37,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:13:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1560204614, now seen corresponding path program 1 times [2024-10-14 13:13:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:13:37,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937826288] [2024-10-14 13:13:37,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:13:37,290 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 [2024-10-14 13:13:37,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:13:37,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:13:37,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 13:13:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:13:37,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:13:37,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:13:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-14 13:13:37,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:13:37,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:13:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937826288] [2024-10-14 13:13:37,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937826288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:13:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [2142106433] [2024-10-14 13:13:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:13:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:13:37,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:13:37,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:13:37,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-14 13:13:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:13:37,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-14 13:13:37,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:13:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-14 13:13:39,955 INFO L311 TraceCheckSpWp]: Computing backward predicates...