./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:06:27,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:06:27,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:06:27,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:06:27,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:06:27,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:06:27,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:06:27,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:06:27,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:06:27,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:06:27,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:06:27,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:06:27,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:06:27,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:27,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:06:27,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:06:27,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:06:27,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:06:27,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:06:27,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:06:27,695 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/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 -> 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc [2025-03-04 00:06:27,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:06:27,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:06:27,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:06:27,935 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:06:27,936 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:06:27,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2025-03-04 00:06:29,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3641222a8/704463b1591b49a2b0aadd15df719230/FLAGc07de26ae [2025-03-04 00:06:29,437 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:06:29,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2025-03-04 00:06:29,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3641222a8/704463b1591b49a2b0aadd15df719230/FLAGc07de26ae [2025-03-04 00:06:29,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3641222a8/704463b1591b49a2b0aadd15df719230 [2025-03-04 00:06:29,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:06:29,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:06:29,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:29,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:06:29,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:06:29,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:29,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29, skipping insertion in model container [2025-03-04 00:06:29,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:29,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:06:29,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i[915,928] [2025-03-04 00:06:29,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:29,883 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:06:29,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i[915,928] [2025-03-04 00:06:29,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:29,914 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:06:29,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29 WrapperNode [2025-03-04 00:06:29,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:29,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:29,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:06:29,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:06:29,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:29,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:29,953 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-03-04 00:06:29,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:29,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:06:29,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:06:29,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:06:29,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:29,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:29,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:29,995 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-03-04 00:06:29,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:29,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:30,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:30,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:30,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:30,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:30,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:06:30,013 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:06:30,013 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:06:30,013 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:06:30,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (1/1) ... [2025-03-04 00:06:30,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:06:30,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:06:30,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:06:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:06:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:06:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:06:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:06:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:06:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:06:30,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:06:30,154 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:06:30,360 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc property_#t~ite12#1;havoc property_#t~bitwise11#1; [2025-03-04 00:06:30,376 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 00:06:30,376 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:06:30,397 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:06:30,397 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:06:30,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:30 BoogieIcfgContainer [2025-03-04 00:06:30,398 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:06:30,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:06:30,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:06:30,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:06:30,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:06:29" (1/3) ... [2025-03-04 00:06:30,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b70607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:30, skipping insertion in model container [2025-03-04 00:06:30,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:29" (2/3) ... [2025-03-04 00:06:30,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b70607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:30, skipping insertion in model container [2025-03-04 00:06:30,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:30" (3/3) ... [2025-03-04 00:06:30,406 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-84.i [2025-03-04 00:06:30,417 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:06:30,418 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-84.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:06:30,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:06:30,485 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;@227418bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:06:30,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:06:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 00:06:30,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:30,500 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:30,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:30,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1457871983, now seen corresponding path program 1 times [2025-03-04 00:06:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:06:30,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992881199] [2025-03-04 00:06:30,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:06:30,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 00:06:30,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 00:06:30,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:30,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 00:06:30,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:06:30,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992881199] [2025-03-04 00:06:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992881199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946978566] [2025-03-04 00:06:30,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:30,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:06:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:06:30,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:06:30,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:06:30,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 00:06:30,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 00:06:30,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:30,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:30,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:06:30,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 00:06:30,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:06:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946978566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:30,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:06:30,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:06:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104289350] [2025-03-04 00:06:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:30,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:06:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:06:30,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:06:30,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:06:30,870 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:06:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:30,890 INFO L93 Difference]: Finished difference Result 92 states and 144 transitions. [2025-03-04 00:06:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:06:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-03-04 00:06:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:30,897 INFO L225 Difference]: With dead ends: 92 [2025-03-04 00:06:30,897 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 00:06:30,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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-03-04 00:06:30,904 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:30,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:06:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 00:06:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-04 00:06:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2025-03-04 00:06:30,938 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 74 [2025-03-04 00:06:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:30,938 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-04 00:06:30,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:06:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2025-03-04 00:06:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 00:06:30,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:30,942 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:30,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:06:31,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:06:31,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:31,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2051683630, now seen corresponding path program 1 times [2025-03-04 00:06:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:06:31,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-03-04 00:06:31,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:06:31,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 00:06:31,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 00:06:31,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:31,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:06:31,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:06:31,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 00:06:31,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 00:06:31,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:31,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:06:31,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:06:31,272 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:06:31,272 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:06:31,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:06:31,276 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:06:31,335 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:06:31,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:06:31 BoogieIcfgContainer [2025-03-04 00:06:31,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:06:31,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:06:31,340 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:06:31,341 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:06:31,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:30" (3/4) ... [2025-03-04 00:06:31,343 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:06:31,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:06:31,345 INFO L158 Benchmark]: Toolchain (without parser) took 1625.79ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 102.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2025-03-04 00:06:31,346 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 126.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:31,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.90ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.2MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:31,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.02ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:31,348 INFO L158 Benchmark]: Boogie Preprocessor took 53.66ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:31,348 INFO L158 Benchmark]: IcfgBuilder took 384.70ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 74.3MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:31,348 INFO L158 Benchmark]: TraceAbstraction took 938.88ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 103.3MB in the end (delta: -29.0MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2025-03-04 00:06:31,348 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 103.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:31,351 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.22ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 126.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.90ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.2MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.02ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.66ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 384.70ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 74.3MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 938.88ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 103.3MB in the end (delta: -29.0MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 103.2MB in the end (delta: 41.6kB). 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 58, overapproximation of someBinaryFLOATComparisonOperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned short int var_1_2 = 128; [L24] unsigned short int var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 49.5; [L29] float var_1_8 = 16.25; VAL [isInitial=0, var_1_1=1, var_1_2=128, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L67] isInitial = 1 [L68] FCALL initially() [L69] COND TRUE 1 [L70] FCALL updateLastVariables() [L71] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_ushort() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L44] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L44] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L45] var_1_3 = __VERIFIER_nondet_ushort() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L47] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L47] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L50] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L50] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L51] var_1_5 = __VERIFIER_nondet_uchar() [L52] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L52] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L53] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L53] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L54] var_1_6 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_7=99/2, var_1_8=65/4] [L55] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_7=99/2, var_1_8=65/4] [L56] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L56] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L57] var_1_8 = __VERIFIER_nondet_float() [L58] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L58] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L71] RET updateVariables() [L72] CALL step() [L33] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=4, var_1_1=1, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L34] COND FALSE !(var_1_2 == stepLocal_0) [L37] var_1_1 = (var_1_4 && (var_1_5 && var_1_6)) VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L39] var_1_7 = var_1_8 VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=133, var_1_8=133] [L72] RET step() [L73] CALL, EXPR property() [L63] EXPR (var_1_2 == var_1_3) ? (var_1_1 == ((unsigned char) ((var_1_3 > (50 ^ var_1_2)) && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && (var_1_5 && var_1_6)))) VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=133, var_1_8=133] [L63-L64] return ((var_1_2 == var_1_3) ? (var_1_1 == ((unsigned char) ((var_1_3 > (50 ^ var_1_2)) && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && (var_1_5 && var_1_6))))) && (var_1_7 == ((float) var_1_8)) ; [L73] RET, EXPR property() [L73] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=133, var_1_8=133] [L19] reach_error() VAL [isInitial=1, var_1_1=0, var_1_2=1, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=133, var_1_8=133] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 60 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 172 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 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-03-04 00:06:31,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:06:33,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:06:33,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:06:33,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:06:33,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:06:33,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:06:33,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:06:33,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:06:33,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:06:33,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:06:33,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:06:33,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:06:33,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:06:33,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:06:33,547 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:06:33,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:06:33,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:06:33,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:06:33,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:06:33,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:06:33,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:06:33,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:06:33,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:33,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:06:33,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:06:33,549 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:06:33,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:06:33,549 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:06:33,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:06:33,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:06:33,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:06:33,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:06:33,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:06:33,550 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/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 -> 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc [2025-03-04 00:06:33,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:06:33,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:06:33,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:06:33,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:06:33,842 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:06:33,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2025-03-04 00:06:35,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a123ea10a/3a7d14aa1080451ea7face017b3a1193/FLAGdb9c0ee91 [2025-03-04 00:06:35,297 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:06:35,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2025-03-04 00:06:35,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a123ea10a/3a7d14aa1080451ea7face017b3a1193/FLAGdb9c0ee91 [2025-03-04 00:06:35,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a123ea10a/3a7d14aa1080451ea7face017b3a1193 [2025-03-04 00:06:35,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:06:35,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:06:35,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:35,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:06:35,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:06:35,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e437bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35, skipping insertion in model container [2025-03-04 00:06:35,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:06:35,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i[915,928] [2025-03-04 00:06:35,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:35,869 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:06:35,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i[915,928] [2025-03-04 00:06:35,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:35,910 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:06:35,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35 WrapperNode [2025-03-04 00:06:35,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:35,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:35,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:06:35,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:06:35,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,946 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2025-03-04 00:06:35,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:35,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:06:35,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:06:35,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:06:35,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,974 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-03-04 00:06:35,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:06:35,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:06:35,993 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:06:35,993 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:06:35,994 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (1/1) ... [2025-03-04 00:06:35,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:36,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:06:36,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:06:36,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:06:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:06:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:06:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:06:36,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:06:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:06:36,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:06:36,103 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:06:36,106 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:06:36,242 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:06:36,243 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:06:36,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:06:36,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:06:36,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:36 BoogieIcfgContainer [2025-03-04 00:06:36,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:06:36,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:06:36,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:06:36,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:06:36,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:06:35" (1/3) ... [2025-03-04 00:06:36,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b4ae83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:36, skipping insertion in model container [2025-03-04 00:06:36,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:35" (2/3) ... [2025-03-04 00:06:36,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b4ae83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:36, skipping insertion in model container [2025-03-04 00:06:36,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:36" (3/3) ... [2025-03-04 00:06:36,262 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-84.i [2025-03-04 00:06:36,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:06:36,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-84.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:06:36,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:06:36,337 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;@51c51ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:06:36,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:06:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:06:36,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:36,350 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:36,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:36,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:36,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1181168805, now seen corresponding path program 1 times [2025-03-04 00:06:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128311489] [2025-03-04 00:06:36,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:36,365 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-03-04 00:06:36,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:36,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:36,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:06:36,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:06:36,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:06:36,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:36,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:36,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:06:36,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-04 00:06:36,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:06:36,516 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128311489] [2025-03-04 00:06:36,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128311489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:36,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:06:36,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:06:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059733827] [2025-03-04 00:06:36,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:06:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:06:36,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:06:36,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:06:36,538 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:06:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:36,553 INFO L93 Difference]: Finished difference Result 68 states and 106 transitions. [2025-03-04 00:06:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:06:36,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2025-03-04 00:06:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:36,559 INFO L225 Difference]: With dead ends: 68 [2025-03-04 00:06:36,559 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 00:06:36,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-03-04 00:06:36,563 INFO L435 NwaCegarLoop]: 45 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, 45 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-03-04 00:06:36,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:06:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 00:06:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 00:06:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-04 00:06:36,591 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 72 [2025-03-04 00:06:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-04 00:06:36,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:06:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-04 00:06:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:06:36,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:36,594 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:36,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:06:36,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:36,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:36,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash 294307802, now seen corresponding path program 1 times [2025-03-04 00:06:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:36,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823272846] [2025-03-04 00:06:36,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:36,797 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-03-04 00:06:36,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:36,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:36,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:06:36,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:06:36,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:06:36,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:36,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:36,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:06:36,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 00:06:38,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:06:38,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:38,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823272846] [2025-03-04 00:06:38,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823272846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:38,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [794877314] [2025-03-04 00:06:38,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:38,710 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 00:06:38,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 00:06:38,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 00:06:38,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-04 00:06:38,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:06:38,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:06:38,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:38,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:38,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:06:38,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 00:06:39,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:06:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 00:06:40,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [794877314] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:40,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:06:40,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 13] total 29 [2025-03-04 00:06:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164618030] [2025-03-04 00:06:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:40,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:06:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:06:40,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:06:40,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:06:40,045 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:06:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:40,462 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-03-04 00:06:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:06:40,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2025-03-04 00:06:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:40,464 INFO L225 Difference]: With dead ends: 49 [2025-03-04 00:06:40,464 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 00:06:40,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:06:40,465 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 71 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:40,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 133 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:06:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 00:06:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2025-03-04 00:06:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:06:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-03-04 00:06:40,481 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 72 [2025-03-04 00:06:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:40,482 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-03-04 00:06:40,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:06:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-03-04 00:06:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:06:40,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:40,484 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:40,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-04 00:06:40,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:06:40,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:40,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 322936953, now seen corresponding path program 1 times [2025-03-04 00:06:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107590903] [2025-03-04 00:06:40,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:40,886 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-03-04 00:06:40,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:40,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:40,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 00:06:40,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:06:40,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:06:40,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:40,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:40,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:06:40,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 00:06:41,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:06:41,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:41,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107590903] [2025-03-04 00:06:41,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107590903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:41,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1609986565] [2025-03-04 00:06:41,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 00:06:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 00:06:41,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 00:06:41,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-04 00:06:41,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:06:42,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:06:42,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:42,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:42,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:06:42,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 00:06:42,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:06:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 00:06:43,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1609986565] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:43,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:06:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 13] total 29 [2025-03-04 00:06:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789851378] [2025-03-04 00:06:43,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:43,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:06:43,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:06:43,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:06:43,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 00:06:43,512 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:06:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:44,156 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-03-04 00:06:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:06:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2025-03-04 00:06:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:44,157 INFO L225 Difference]: With dead ends: 47 [2025-03-04 00:06:44,157 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:06:44,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 00:06:44,158 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:44,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 130 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:06:44,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:06:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:06:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:06:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:06:44,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2025-03-04 00:06:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:06:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:06:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:06:44,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:06:44,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:06:44,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 00:06:44,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-04 00:06:44,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 00:06:44,568 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:06:44,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:06:44,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:06:44,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2025-03-04 00:06:44,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:06:44 BoogieIcfgContainer [2025-03-04 00:06:44,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:06:44,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:06:44,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:06:44,761 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:06:44,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:36" (3/4) ... [2025-03-04 00:06:44,763 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:06:44,767 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:06:44,771 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:06:44,771 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:06:44,771 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:06:44,771 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:06:44,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:06:44,836 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:06:44,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:06:44,837 INFO L158 Benchmark]: Toolchain (without parser) took 9161.15ms. Allocated memory was 83.9MB in the beginning and 260.0MB in the end (delta: 176.2MB). Free memory was 59.5MB in the beginning and 135.4MB in the end (delta: -75.9MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,838 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 62.7MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:44,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.80ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 47.3MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.91ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 45.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,838 INFO L158 Benchmark]: Boogie Preprocessor took 42.77ms. Allocated memory is still 83.9MB. Free memory was 45.6MB in the beginning and 44.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:44,839 INFO L158 Benchmark]: IcfgBuilder took 259.11ms. Allocated memory is still 83.9MB. Free memory was 44.1MB in the beginning and 31.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,839 INFO L158 Benchmark]: TraceAbstraction took 8506.19ms. Allocated memory was 83.9MB in the beginning and 260.0MB in the end (delta: 176.2MB). Free memory was 30.7MB in the beginning and 143.6MB in the end (delta: -112.8MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,839 INFO L158 Benchmark]: Witness Printer took 75.54ms. Allocated memory is still 260.0MB. Free memory was 143.6MB in the beginning and 135.4MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:44,841 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.42ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 62.7MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.80ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 47.3MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.91ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 45.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.77ms. Allocated memory is still 83.9MB. Free memory was 45.6MB in the beginning and 44.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 259.11ms. Allocated memory is still 83.9MB. Free memory was 44.1MB in the beginning and 31.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8506.19ms. Allocated memory was 83.9MB in the beginning and 260.0MB in the end (delta: 176.2MB). Free memory was 30.7MB in the beginning and 143.6MB in the end (delta: -112.8MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 75.54ms. Allocated memory is still 260.0MB. Free memory was 143.6MB in the beginning and 135.4MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 122 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 453 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 497 ConstructedInterpolants, 8 QuantifiedInterpolants, 2305 SizeOfPredicates, 48 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1492/1540 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 00:06:44,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE