./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13162354a30f61815ef67cb01318a2427f055a532be2e9258309b67d1af8560f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:18:37,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:18:37,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:18:37,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:18:37,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:18:37,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:18:37,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:18:37,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:18:37,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:18:37,418 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:18:37,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:18:37,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:18:37,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:18:37,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:18:37,420 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:18:37,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:18:37,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:18:37,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:18:37,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:18:37,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:18:37,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:18:37,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:18:37,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:18:37,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:18:37,421 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:18:37,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:18:37,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:18:37,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:18:37,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:18:37,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:18:37,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:18:37,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:18:37,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:18:37,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:18:37,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:18:37,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:18:37,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:18:37,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:18:37,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:18:37,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:18:37,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:18:37,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:18:37,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:18:37,424 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13162354a30f61815ef67cb01318a2427f055a532be2e9258309b67d1af8560f [2025-02-06 01:18:37,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:18:37,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:18:37,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:18:37,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:18:37,761 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:18:37,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i [2025-02-06 01:18:39,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5441f66c3/c45b441467dc49e083cbf3dc64657780/FLAGfca63a73e [2025-02-06 01:18:39,416 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:18:39,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i [2025-02-06 01:18:39,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5441f66c3/c45b441467dc49e083cbf3dc64657780/FLAGfca63a73e [2025-02-06 01:18:39,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5441f66c3/c45b441467dc49e083cbf3dc64657780 [2025-02-06 01:18:39,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:18:39,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:18:39,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:18:39,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:18:39,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:18:39,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39, skipping insertion in model container [2025-02-06 01:18:39,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:18:39,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i[915,928] [2025-02-06 01:18:39,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:18:39,675 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:18:39,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i[915,928] [2025-02-06 01:18:39,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:18:39,730 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:18:39,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39 WrapperNode [2025-02-06 01:18:39,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:18:39,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:18:39,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:18:39,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:18:39,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,773 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-02-06 01:18:39,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:18:39,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:18:39,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:18:39,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:18:39,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,806 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:18:39,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:18:39,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:18:39,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:18:39,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:18:39,832 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (1/1) ... [2025-02-06 01:18:39,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:18:39,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:18:39,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:18:39,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:18:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:18:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:18:39,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:18:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:18:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:18:39,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:18:39,971 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:18:39,973 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:18:40,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise16#1;havoc property_#t~short17#1; [2025-02-06 01:18:40,261 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-06 01:18:40,261 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:18:40,275 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:18:40,276 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 01:18:40,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:40 BoogieIcfgContainer [2025-02-06 01:18:40,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:18:40,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:18:40,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:18:40,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:18:40,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:18:39" (1/3) ... [2025-02-06 01:18:40,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdc1baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:40, skipping insertion in model container [2025-02-06 01:18:40,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:39" (2/3) ... [2025-02-06 01:18:40,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdc1baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:40, skipping insertion in model container [2025-02-06 01:18:40,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:40" (3/3) ... [2025-02-06 01:18:40,288 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-98.i [2025-02-06 01:18:40,302 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:18:40,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-98.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:18:40,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:18:40,377 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;@d5661f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:18:40,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:18:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:18:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 01:18:40,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:18:40,397 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:18:40,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:18:40,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:18:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1216332225, now seen corresponding path program 1 times [2025-02-06 01:18:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:18:40,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232775687] [2025-02-06 01:18:40,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:18:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:18:40,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 01:18:40,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 01:18:40,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:18:40,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:18:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 01:18:40,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:18:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232775687] [2025-02-06 01:18:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232775687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:18:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049313745] [2025-02-06 01:18:40,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:18:40,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:18:40,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:18:40,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:18:40,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:18:40,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 01:18:40,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 01:18:40,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:18:40,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:18:40,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:18:40,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:18:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 01:18:40,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:18:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049313745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:18:40,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:18:40,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:18:40,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872369020] [2025-02-06 01:18:40,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:18:40,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:18:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:18:40,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:18:40,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:18:40,986 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 01:18:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:18:41,036 INFO L93 Difference]: Finished difference Result 119 states and 193 transitions. [2025-02-06 01:18:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:18:41,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-02-06 01:18:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:18:41,049 INFO L225 Difference]: With dead ends: 119 [2025-02-06 01:18:41,050 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 01:18:41,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:18:41,059 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:18:41,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:18:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 01:18:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 01:18:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:18:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2025-02-06 01:18:41,097 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 128 [2025-02-06 01:18:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:18:41,097 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-02-06 01:18:41,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 01:18:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2025-02-06 01:18:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 01:18:41,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:18:41,103 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:18:41,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:18:41,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:18:41,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:18:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:18:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash -791765505, now seen corresponding path program 1 times [2025-02-06 01:18:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:18:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875580696] [2025-02-06 01:18:41,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:18:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:18:41,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 01:18:41,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 01:18:41,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:18:41,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:18:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940415591] [2025-02-06 01:18:41,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:18:41,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:18:41,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:18:41,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:18:41,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:18:41,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 01:18:41,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 01:18:41,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:18:41,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:18:41,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 01:18:41,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:18:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 307 proven. 129 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 01:18:43,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:18:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 01:18:43,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:18:43,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875580696] [2025-02-06 01:18:43,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 01:18:43,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940415591] [2025-02-06 01:18:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940415591] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:18:43,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 01:18:43,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2025-02-06 01:18:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677216929] [2025-02-06 01:18:43,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 01:18:43,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 01:18:43,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:18:43,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 01:18:43,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-02-06 01:18:43,956 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 6 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) [2025-02-06 01:18:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:18:45,812 INFO L93 Difference]: Finished difference Result 148 states and 198 transitions. [2025-02-06 01:18:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 01:18:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 6 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) Word has length 128 [2025-02-06 01:18:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:18:45,816 INFO L225 Difference]: With dead ends: 148 [2025-02-06 01:18:45,817 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 01:18:45,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 01:18:45,819 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 84 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:18:45,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 324 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 01:18:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 01:18:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2025-02-06 01:18:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:18:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2025-02-06 01:18:45,842 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 128 [2025-02-06 01:18:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:18:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2025-02-06 01:18:45,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 6 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 7 states have call predecessors, (38), 6 states have call successors, (38) [2025-02-06 01:18:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2025-02-06 01:18:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 01:18:45,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:18:45,846 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:18:45,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:18:46,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:18:46,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:18:46,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:18:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 95738176, now seen corresponding path program 1 times [2025-02-06 01:18:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:18:46,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453670197] [2025-02-06 01:18:46,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:18:46,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:18:46,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 01:18:46,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 01:18:46,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:18:46,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:18:46,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183246131] [2025-02-06 01:18:46,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:18:46,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:18:46,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:18:46,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:18:46,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 01:18:46,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 01:18:46,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 01:18:46,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:18:46,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:18:46,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:18:46,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 01:18:46,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 01:18:46,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:18:46,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:18:46,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:18:46,348 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:18:46,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:18:46,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 01:18:46,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:18:46,553 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 01:18:46,631 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:18:46,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:18:46 BoogieIcfgContainer [2025-02-06 01:18:46,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:18:46,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:18:46,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:18:46,639 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:18:46,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:40" (3/4) ... [2025-02-06 01:18:46,641 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:18:46,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:18:46,643 INFO L158 Benchmark]: Toolchain (without parser) took 7192.21ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 42.5MB in the end (delta: 69.5MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2025-02-06 01:18:46,644 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:18:46,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.91ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 99.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:18:46,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.10ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:18:46,645 INFO L158 Benchmark]: Boogie Preprocessor took 56.25ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:18:46,645 INFO L158 Benchmark]: IcfgBuilder took 446.60ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 78.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:18:46,645 INFO L158 Benchmark]: TraceAbstraction took 6356.61ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 42.5MB in the end (delta: 35.2MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2025-02-06 01:18:46,645 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 42.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:18:46,646 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.27ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.91ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 99.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.10ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.25ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 446.60ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 78.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6356.61ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 42.5MB in the end (delta: 35.2MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 42.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.8; [L23] double var_1_2 = 63.5; [L24] double var_1_3 = 9999999.5; [L25] double var_1_4 = 0.6; [L26] signed short int var_1_6 = 10; [L27] signed long int var_1_7 = -1; [L28] double var_1_8 = 32.34; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_11 = 1; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 0; [L34] unsigned long int var_1_15 = 0; [L35] unsigned long int var_1_16 = 2731588682; [L36] unsigned long int var_1_17 = 2; [L37] unsigned long int var_1_18 = 50; [L38] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_2=127/2, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L98] isInitial = 1 [L99] FCALL initially() [L100] int k_loop; [L101] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_2=127/2, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L101] COND TRUE k_loop < 1 [L102] CALL updateLastVariables() [L91] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_2=127/2, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L58] var_1_2 = __VERIFIER_nondet_double() [L59] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L59] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L60] var_1_3 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L61] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L62] var_1_6 = __VERIFIER_nondet_short() [L63] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L63] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L64] CALL assume_abort_if_not(var_1_6 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L64] RET assume_abort_if_not(var_1_6 <= 32) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=1617/50, var_1_9=0] [L65] var_1_7 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L66] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L67] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L68] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=1617/50, var_1_9=0] [L69] var_1_8 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L70] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L71] var_1_11 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L80] var_1_14 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L81] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2731588682, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L83] var_1_16 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=2, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L86] var_1_17 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L103] RET updateVariables() [L104] CALL step() [L42] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L43] COND FALSE !(((- var_1_2) * var_1_8) == var_1_1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L46] COND TRUE \read(var_1_14) [L47] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=50, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L51] var_1_18 = var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L52] EXPR var_1_18 >> var_1_6 VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L52] unsigned long int stepLocal_0 = (var_1_18 >> var_1_6) / var_1_7; [L53] COND FALSE !(8 < stepLocal_0) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L104] RET step() [L105] CALL, EXPR property() [L94] EXPR (var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_18 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) ((15.475 + 256.75) + var_1_8))) : 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L94-L95] return ((((var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_18 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) ((15.475 + 256.75) + var_1_8))) : 1)) && ((((- var_1_2) * var_1_8) == var_1_1) ? (var_1_9 == ((unsigned char) ((last_1_var_1_9 || var_1_11) && (var_1_12 && (var_1_13 && var_1_14))))) : 1)) && (var_1_14 ? (var_1_15 == ((unsigned long int) var_1_6)) : (var_1_15 == ((unsigned long int) (var_1_16 - ((((var_1_6) > ((1251570750u - var_1_17))) ? (var_1_6) : ((1251570750u - var_1_17))))))))) && (var_1_18 == ((unsigned long int) var_1_6)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2147483647, var_1_17=0, var_1_18=0, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 408 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 511 IncrementalHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 141 mSDtfsCounter, 511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=2, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 768 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 508 ConstructedInterpolants, 1 QuantifiedInterpolants, 2722 SizeOfPredicates, 3 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2834/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 01:18:46,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13162354a30f61815ef67cb01318a2427f055a532be2e9258309b67d1af8560f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:18:48,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:18:48,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:18:48,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:18:48,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:18:48,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:18:48,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:18:48,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:18:48,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:18:48,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:18:48,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:18:48,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:18:48,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:18:48,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:18:48,996 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:18:48,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:18:48,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:18:48,996 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:18:48,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:18:48,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:18:48,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:18:48,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:18:48,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:18:48,997 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:18:48,997 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:18:48,997 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:18:48,997 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:18:48,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:18:48,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:18:48,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:18:48,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:18:48,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:18:48,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:18:48,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:18:48,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:18:48,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:18:48,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:18:48,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:18:48,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:18:48,999 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:18:48,999 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:18:48,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:18:49,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:18:49,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:18:49,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:18:49,000 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13162354a30f61815ef67cb01318a2427f055a532be2e9258309b67d1af8560f [2025-02-06 01:18:49,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:18:49,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:18:49,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:18:49,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:18:49,272 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:18:49,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i [2025-02-06 01:18:50,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbfd6dc56/00c4703fa1a54f8d9bb76811063e279e/FLAG92e3ef9bb [2025-02-06 01:18:50,766 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:18:50,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i [2025-02-06 01:18:50,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbfd6dc56/00c4703fa1a54f8d9bb76811063e279e/FLAG92e3ef9bb [2025-02-06 01:18:51,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbfd6dc56/00c4703fa1a54f8d9bb76811063e279e [2025-02-06 01:18:51,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:18:51,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:18:51,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:18:51,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:18:51,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:18:51,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe856e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51, skipping insertion in model container [2025-02-06 01:18:51,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:18:51,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i[915,928] [2025-02-06 01:18:51,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:18:51,317 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:18:51,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-98.i[915,928] [2025-02-06 01:18:51,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:18:51,363 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:18:51,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51 WrapperNode [2025-02-06 01:18:51,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:18:51,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:18:51,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:18:51,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:18:51,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,406 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-02-06 01:18:51,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:18:51,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:18:51,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:18:51,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:18:51,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:18:51,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:18:51,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:18:51,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:18:51,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:18:51,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (1/1) ... [2025-02-06 01:18:51,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:18:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:18:51,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:18:51,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:18:51,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:18:51,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:18:51,534 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:18:51,534 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:18:51,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:18:51,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:18:51,617 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:18:51,619 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:18:59,799 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 01:18:59,801 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:18:59,810 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:18:59,810 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:18:59,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:59 BoogieIcfgContainer [2025-02-06 01:18:59,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:18:59,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:18:59,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:18:59,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:18:59,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:18:51" (1/3) ... [2025-02-06 01:18:59,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:59, skipping insertion in model container [2025-02-06 01:18:59,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:18:51" (2/3) ... [2025-02-06 01:18:59,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:18:59, skipping insertion in model container [2025-02-06 01:18:59,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:18:59" (3/3) ... [2025-02-06 01:18:59,819 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-98.i [2025-02-06 01:18:59,830 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:18:59,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-98.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:18:59,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:18:59,884 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;@4fa71a6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:18:59,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:18:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:18:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:18:59,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:18:59,898 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:18:59,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:18:59,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:18:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1947090457, now seen corresponding path program 1 times [2025-02-06 01:18:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:18:59,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443120312] [2025-02-06 01:18:59,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:18:59,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:18:59,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:18:59,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:18:59,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 01:18:59,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:19:00,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:19:00,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:19:00,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:19:00,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:19:00,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:19:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-02-06 01:19:00,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:19:00,483 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:19:00,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443120312] [2025-02-06 01:19:00,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443120312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:19:00,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:19:00,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:19:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64817754] [2025-02-06 01:19:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:19:00,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:19:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:19:00,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:19:00,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:19:00,517 INFO L87 Difference]: Start difference. First operand has 53 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 01:19:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:19:00,535 INFO L93 Difference]: Finished difference Result 103 states and 171 transitions. [2025-02-06 01:19:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:19:00,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2025-02-06 01:19:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:19:00,541 INFO L225 Difference]: With dead ends: 103 [2025-02-06 01:19:00,541 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 01:19:00,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:19:00,546 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:19:00,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:19:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 01:19:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 01:19:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:19:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-02-06 01:19:00,580 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 124 [2025-02-06 01:19:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:19:00,580 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-02-06 01:19:00,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 01:19:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-02-06 01:19:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:19:00,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:19:00,587 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:19:00,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 01:19:00,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:19:00,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:19:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:19:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1125776985, now seen corresponding path program 1 times [2025-02-06 01:19:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:19:00,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359030460] [2025-02-06 01:19:00,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:19:00,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:19:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:19:00,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:19:00,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 01:19:00,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:19:01,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:19:01,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:19:01,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:19:01,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 01:19:01,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:19:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 327 proven. 15 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-02-06 01:19:01,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:19:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 01:19:02,784 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:19:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359030460] [2025-02-06 01:19:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359030460] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:19:02,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 01:19:02,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-06 01:19:02,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801121146] [2025-02-06 01:19:02,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 01:19:02,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:19:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:19:02,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:19:02,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:19:02,788 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:19:04,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:19:09,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:19:13,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:19:16,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:19:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:19:17,599 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2025-02-06 01:19:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:19:17,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 124 [2025-02-06 01:19:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:19:17,601 INFO L225 Difference]: With dead ends: 129 [2025-02-06 01:19:17,601 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 01:19:17,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:19:17,602 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-02-06 01:19:17,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 142 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 193 Invalid, 2 Unknown, 0 Unchecked, 14.6s Time] [2025-02-06 01:19:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 01:19:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2025-02-06 01:19:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 01:19:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-02-06 01:19:17,615 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 124 [2025-02-06 01:19:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:19:17,616 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-02-06 01:19:17,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:19:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-02-06 01:19:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:19:17,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:19:17,618 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:19:17,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 01:19:17,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:19:17,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:19:17,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:19:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2013280666, now seen corresponding path program 1 times [2025-02-06 01:19:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:19:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861889662] [2025-02-06 01:19:17,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:19:17,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:19:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:19:17,823 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:19:17,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 01:19:17,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:19:18,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:19:18,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:19:18,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:19:18,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 01:19:18,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:19:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 307 proven. 129 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 01:19:23,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:19:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 01:19:31,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:19:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861889662] [2025-02-06 01:19:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861889662] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:19:31,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 01:19:31,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2025-02-06 01:19:31,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508194200] [2025-02-06 01:19:31,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 01:19:31,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 01:19:31,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:19:31,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 01:19:31,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-02-06 01:19:31,048 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2025-02-06 01:19:41,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:19:44,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:19:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:19:44,432 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2025-02-06 01:19:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 01:19:44,482 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) Word has length 124 [2025-02-06 01:19:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:19:44,485 INFO L225 Difference]: With dead ends: 158 [2025-02-06 01:19:44,485 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 01:19:44,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2025-02-06 01:19:44,487 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:19:44,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 182 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 10.4s Time] [2025-02-06 01:19:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 01:19:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2025-02-06 01:19:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 59 states have internal predecessors, (60), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 01:19:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2025-02-06 01:19:44,501 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 124 [2025-02-06 01:19:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:19:44,502 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2025-02-06 01:19:44,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2025-02-06 01:19:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2025-02-06 01:19:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:19:44,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:19:44,504 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:19:44,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 01:19:44,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:19:44,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:19:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:19:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2012357145, now seen corresponding path program 1 times [2025-02-06 01:19:44,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:19:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293654707] [2025-02-06 01:19:44,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:19:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:19:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:19:44,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:19:44,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 01:19:44,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:19:45,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:19:45,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:19:45,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:19:45,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 01:19:45,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:20:00,534 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:20:08,646 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)