./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.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 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:40:04,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:40:04,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:40:04,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:40:04,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:40:04,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:40:04,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:40:04,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:40:04,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:40:04,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:40:04,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:40:04,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:40:04,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:40:04,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:40:04,332 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:40:04,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:40:04,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:40:04,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:40:04,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:40:04,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:40:04,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:40:04,334 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 -> 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be [2025-01-09 14:40:04,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:40:04,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:40:04,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:40:04,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:40:04,577 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:40:04,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-01-09 14:40:05,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f39552cd/069ebb78baf3433a95a031d67d7f5cad/FLAGe1baca0b8 [2025-01-09 14:40:05,966 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:40:05,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-01-09 14:40:05,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f39552cd/069ebb78baf3433a95a031d67d7f5cad/FLAGe1baca0b8 [2025-01-09 14:40:06,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f39552cd/069ebb78baf3433a95a031d67d7f5cad [2025-01-09 14:40:06,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:40:06,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:40:06,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:40:06,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:40:06,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:40:06,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47167c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06, skipping insertion in model container [2025-01-09 14:40:06,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:40:06,366 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_operatoramount_amount25_file-78.i[915,928] [2025-01-09 14:40:06,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:40:06,410 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:40:06,419 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_operatoramount_amount25_file-78.i[915,928] [2025-01-09 14:40:06,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:40:06,449 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:40:06,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06 WrapperNode [2025-01-09 14:40:06,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:40:06,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:40:06,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:40:06,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:40:06,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,477 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2025-01-09 14:40:06,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:40:06,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:40:06,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:40:06,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:40:06,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,501 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:40:06,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:40:06,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:40:06,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:40:06,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:40:06,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (1/1) ... [2025-01-09 14:40:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:40:06,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:40:06,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:40:06,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:40:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:40:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:40:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:40:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:40:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:40:06,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:40:06,610 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:40:06,611 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:40:06,773 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:40:06,774 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:40:06,780 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:40:06,781 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:40:06,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:06 BoogieIcfgContainer [2025-01-09 14:40:06,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:40:06,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:40:06,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:40:06,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:40:06,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:40:06" (1/3) ... [2025-01-09 14:40:06,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b58514b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:06, skipping insertion in model container [2025-01-09 14:40:06,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:06" (2/3) ... [2025-01-09 14:40:06,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b58514b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:06, skipping insertion in model container [2025-01-09 14:40:06,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:06" (3/3) ... [2025-01-09 14:40:06,791 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-78.i [2025-01-09 14:40:06,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:40:06,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-78.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:40:06,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:40:06,859 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;@8e8904a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:40:06,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:40:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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-01-09 14:40:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 14:40:06,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:40:06,870 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] [2025-01-09 14:40:06,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:40:06,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:40:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1708405593, now seen corresponding path program 1 times [2025-01-09 14:40:06,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:40:06,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619512261] [2025-01-09 14:40:06,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:40:06,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:40:06,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 14:40:06,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 14:40:06,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:40:06,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:40:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 14:40:07,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:40:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619512261] [2025-01-09 14:40:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619512261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:40:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524097703] [2025-01-09 14:40:07,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:40:07,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:40:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:40:07,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:40:07,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:40:07,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 14:40:07,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 14:40:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:40:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:40:07,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:40:07,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:40:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 14:40:07,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:40:07,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524097703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:40:07,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:40:07,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:40:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550253757] [2025-01-09 14:40:07,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:40:07,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:40:07,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:40:07,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:40:07,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:40:07,321 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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.0) internal successors, (30), 2 states have internal predecessors, (30), 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-01-09 14:40:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:40:07,343 INFO L93 Difference]: Finished difference Result 104 states and 177 transitions. [2025-01-09 14:40:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:40:07,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 125 [2025-01-09 14:40:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:40:07,348 INFO L225 Difference]: With dead ends: 104 [2025-01-09 14:40:07,349 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 14:40:07,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:40:07,355 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-01-09 14:40:07,355 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-01-09 14:40:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 14:40:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 14:40:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-01-09 14:40:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-01-09 14:40:07,385 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 125 [2025-01-09 14:40:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:40:07,385 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-01-09 14:40:07,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-01-09 14:40:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-01-09 14:40:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 14:40:07,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:40:07,389 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] [2025-01-09 14:40:07,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:40:07,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:40:07,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:40:07,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:40:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 64446377, now seen corresponding path program 1 times [2025-01-09 14:40:07,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:40:07,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820111603] [2025-01-09 14:40:07,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:40:07,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:40:07,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 14:40:07,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 14:40:07,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:40:07,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:40:07,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:40:07,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 14:40:07,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 14:40:07,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:40:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:40:07,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:40:07,904 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:40:07,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:40:07,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:40:07,909 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 14:40:07,962 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:40:07,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:40:07 BoogieIcfgContainer [2025-01-09 14:40:07,964 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:40:07,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:40:07,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:40:07,965 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:40:07,965 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:06" (3/4) ... [2025-01-09 14:40:07,967 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:40:07,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:40:07,968 INFO L158 Benchmark]: Toolchain (without parser) took 1712.14ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 110.9MB in the end (delta: 18.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2025-01-09 14:40:07,968 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:40:07,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.97ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 116.4MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:40:07,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 114.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:40:07,971 INFO L158 Benchmark]: Boogie Preprocessor took 36.75ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 112.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:40:07,974 INFO L158 Benchmark]: RCFGBuilder took 267.41ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 97.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:40:07,974 INFO L158 Benchmark]: TraceAbstraction took 1179.13ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 111.0MB in the end (delta: -14.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-01-09 14:40:07,974 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:40:07,975 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.97ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 116.4MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 114.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.75ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 112.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.41ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 97.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1179.13ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 111.0MB in the end (delta: -14.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_6 = 128; [L26] signed long int var_1_7 = 10; [L27] signed short int var_1_8 = 0; [L28] signed short int var_1_9 = 25; [L29] signed short int var_1_10 = 32; [L30] signed short int var_1_11 = 1000; [L31] signed short int var_1_12 = 25; [L32] signed short int var_1_13 = 128; [L33] unsigned long int var_1_14 = 5; [L34] float var_1_15 = 8.25; [L35] float var_1_16 = 63.5; [L36] float var_1_17 = -0.6; [L37] signed long int last_1_var_1_1 = -200; VAL [isInitial=0, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L103] isInitial = 1 [L104] FCALL initially() [L106] CALL updateLastVariables() [L96] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=25] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=25] [L74] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L78] var_1_10 = __VERIFIER_nondet_short() [L79] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L79] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L80] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L80] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L81] var_1_11 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_11 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L82] RET assume_abort_if_not(var_1_11 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L83] CALL assume_abort_if_not(var_1_11 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L83] RET assume_abort_if_not(var_1_11 <= 8192) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L84] var_1_12 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_12 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L85] RET assume_abort_if_not(var_1_12 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L86] CALL assume_abort_if_not(var_1_12 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L86] RET assume_abort_if_not(var_1_12 <= 8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L87] var_1_13 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L89] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L89] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L90] var_1_16 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L91] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L92] var_1_17 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L93] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L107] RET updateVariables() [L108] CALL step() [L41] COND TRUE \read(var_1_3) [L42] var_1_14 = (2931747731u - var_1_10) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L44] unsigned char stepLocal_1 = var_1_3; [L45] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=-256, stepLocal_1=-255, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L46] COND FALSE !(var_1_2 && stepLocal_1) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=-256, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=0, var_1_9=16382] [L53] COND FALSE !(var_1_14 > var_1_14) [L56] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=-256, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=-16384, var_1_9=16382] [L58] COND TRUE var_1_11 >= var_1_1 [L59] var_1_15 = ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=-256, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=-16384, var_1_9=16382] [L108] RET step() [L109] CALL, EXPR property() [L99-L100] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_14 > last_1_var_1_1)) ? (var_1_1 == ((signed long int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed long int) var_1_6))) : 1) && ((var_1_14 > var_1_14) ? (var_1_8 == ((signed short int) ((var_1_9 - var_1_10) + ((((-4) < ((var_1_11 + var_1_12))) ? (-4) : ((var_1_11 + var_1_12))))))) : (var_1_8 == ((signed short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13))))) && (var_1_3 ? (var_1_14 == ((unsigned long int) (2931747731u - var_1_10))) : 1)) && ((var_1_11 >= var_1_1) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=-16384, var_1_9=16382] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=-16384, var_1_9=16382] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=2147483646, var_1_7=2147483646, var_1_8=-16384, var_1_9=16382] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 75 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:40:07,991 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_operatoramount_amount25_file-78.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 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:40:09,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:40:10,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:40:10,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:40:10,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:40:10,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:40:10,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:40:10,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:40:10,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:40:10,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:40:10,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:40:10,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:40:10,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:40:10,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:40:10,098 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:40:10,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:40:10,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:40:10,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:40:10,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:40:10,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:40:10,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:40:10,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:40:10,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:40:10,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:40:10,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:40:10,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:40:10,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:40:10,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:40:10,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:40:10,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:40:10,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:40:10,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:40:10,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:40:10,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:40:10,101 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:40:10,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:40:10,101 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:40:10,101 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:40:10,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:40:10,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:40:10,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:40:10,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:40:10,102 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 -> 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be [2025-01-09 14:40:10,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:40:10,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:40:10,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:40:10,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:40:10,333 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:40:10,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-01-09 14:40:11,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a19dcfeba/17b0398a34a949ac8cdb7c53e96ec2ed/FLAG80c70ad0b [2025-01-09 14:40:11,725 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:40:11,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-01-09 14:40:11,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a19dcfeba/17b0398a34a949ac8cdb7c53e96ec2ed/FLAG80c70ad0b [2025-01-09 14:40:12,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a19dcfeba/17b0398a34a949ac8cdb7c53e96ec2ed [2025-01-09 14:40:12,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:40:12,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:40:12,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:40:12,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:40:12,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:40:12,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164d9e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12, skipping insertion in model container [2025-01-09 14:40:12,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:40:12,215 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_operatoramount_amount25_file-78.i[915,928] [2025-01-09 14:40:12,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:40:12,261 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:40:12,268 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_operatoramount_amount25_file-78.i[915,928] [2025-01-09 14:40:12,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:40:12,289 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:40:12,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12 WrapperNode [2025-01-09 14:40:12,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:40:12,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:40:12,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:40:12,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:40:12,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,312 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-01-09 14:40:12,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:40:12,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:40:12,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:40:12,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:40:12,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,326 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:40:12,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:40:12,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:40:12,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:40:12,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:40:12,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (1/1) ... [2025-01-09 14:40:12,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:40:12,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:40:12,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:40:12,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:40:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:40:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:40:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:40:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:40:12,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:40:12,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:40:12,434 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:40:12,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:40:12,630 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:40:12,630 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:40:12,640 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:40:12,641 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:40:12,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:12 BoogieIcfgContainer [2025-01-09 14:40:12,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:40:12,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:40:12,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:40:12,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:40:12,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:40:12" (1/3) ... [2025-01-09 14:40:12,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c49951d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:12, skipping insertion in model container [2025-01-09 14:40:12,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:12" (2/3) ... [2025-01-09 14:40:12,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c49951d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:12, skipping insertion in model container [2025-01-09 14:40:12,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:12" (3/3) ... [2025-01-09 14:40:12,650 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-78.i [2025-01-09 14:40:12,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:40:12,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-78.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:40:12,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:40:12,714 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;@7805b373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:40:12,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:40:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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-01-09 14:40:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 14:40:12,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:40:12,724 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] [2025-01-09 14:40:12,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:40:12,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:40:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1708405593, now seen corresponding path program 1 times [2025-01-09 14:40:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:40:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195231788] [2025-01-09 14:40:12,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:40:12,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:40:12,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:40:12,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:40:12,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 14:40:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 14:40:12,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 14:40:12,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:40:12,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:40:12,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:40:12,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:40:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 14:40:12,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:40:12,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:40:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195231788] [2025-01-09 14:40:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195231788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:40:12,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:40:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:40:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742407500] [2025-01-09 14:40:12,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:40:12,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:40:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:40:12,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:40:12,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:40:12,999 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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.0) internal successors, (32), 2 states have internal predecessors, (32), 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-01-09 14:40:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:40:13,021 INFO L93 Difference]: Finished difference Result 104 states and 177 transitions. [2025-01-09 14:40:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:40:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 125 [2025-01-09 14:40:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:40:13,029 INFO L225 Difference]: With dead ends: 104 [2025-01-09 14:40:13,029 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 14:40:13,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:40:13,034 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-01-09 14:40:13,036 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-01-09 14:40:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 14:40:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 14:40:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-01-09 14:40:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-01-09 14:40:13,072 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 125 [2025-01-09 14:40:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:40:13,072 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-01-09 14:40:13,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-01-09 14:40:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-01-09 14:40:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 14:40:13,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:40:13,074 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] [2025-01-09 14:40:13,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 14:40:13,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:40:13,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:40:13,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:40:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash 64446377, now seen corresponding path program 1 times [2025-01-09 14:40:13,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:40:13,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951594150] [2025-01-09 14:40:13,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:40:13,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:40:13,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:40:13,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:40:13,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 14:40:13,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 14:40:13,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 14:40:13,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:40:13,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:40:13,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 14:40:13,442 INFO L279 TraceCheckSpWp]: Computing forward predicates...