./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-86.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 248e9a660b5341ec0894e1aed13dbcc752507598fe574e15afae8cc67f5cac10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:17:46,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:17:46,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:17:46,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:17:46,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:17:46,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:17:46,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:17:46,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:17:46,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:17:46,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:17:46,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:17:46,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:17:46,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:17:46,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:17:46,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:17:46,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:17:46,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:17:46,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:17:46,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:17:46,413 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 -> 248e9a660b5341ec0894e1aed13dbcc752507598fe574e15afae8cc67f5cac10 [2025-03-08 15:17:46,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:17:46,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:17:46,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:17:46,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:17:46,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:17:46,663 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-86.i [2025-03-08 15:17:47,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ed0bb2d/9ff500ece8fb44e3a2dd4e082d534270/FLAG498bdcb4f [2025-03-08 15:17:48,021 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:17:48,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i [2025-03-08 15:17:48,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ed0bb2d/9ff500ece8fb44e3a2dd4e082d534270/FLAG498bdcb4f [2025-03-08 15:17:48,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ed0bb2d/9ff500ece8fb44e3a2dd4e082d534270 [2025-03-08 15:17:48,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:17:48,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:17:48,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:17:48,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:17:48,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:17:48,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715f383c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48, skipping insertion in model container [2025-03-08 15:17:48,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:17:48,499 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-86.i[915,928] [2025-03-08 15:17:48,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:17:48,533 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:17:48,542 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-86.i[915,928] [2025-03-08 15:17:48,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:17:48,567 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:17:48,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48 WrapperNode [2025-03-08 15:17:48,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:17:48,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:17:48,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:17:48,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:17:48,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,592 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 61 [2025-03-08 15:17:48,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:17:48,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:17:48,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:17:48,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:17:48,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,614 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-08 15:17:48,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:17:48,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:17:48,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:17:48,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:17:48,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (1/1) ... [2025-03-08 15:17:48,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:17:48,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:17:48,645 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-08 15:17:48,647 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-08 15:17:48,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:17:48,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:17:48,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:17:48,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:17:48,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:17:48,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:17:48,699 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:17:48,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:17:48,788 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:17:48,789 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:17:48,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:17:48,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:17:48,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:17:48 BoogieIcfgContainer [2025-03-08 15:17:48,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:17:48,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:17:48,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:17:48,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:17:48,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:17:48" (1/3) ... [2025-03-08 15:17:48,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574cddff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:17:48, skipping insertion in model container [2025-03-08 15:17:48,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:48" (2/3) ... [2025-03-08 15:17:48,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574cddff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:17:48, skipping insertion in model container [2025-03-08 15:17:48,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:17:48" (3/3) ... [2025-03-08 15:17:48,801 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-86.i [2025-03-08 15:17:48,810 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:17:48,812 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-86.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:17:48,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:17:48,858 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;@622cb5f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:17:48,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:17:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 15:17:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 15:17:48,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:17:48,867 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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-08 15:17:48,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:17:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:17:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1341375704, now seen corresponding path program 1 times [2025-03-08 15:17:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:17:48,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670073839] [2025-03-08 15:17:48,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:17:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:17:48,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 15:17:48,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 15:17:48,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:17:48,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:17:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 15:17:48,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:17:48,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670073839] [2025-03-08 15:17:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670073839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:17:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477981149] [2025-03-08 15:17:48,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:17:48,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:17:48,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:17:48,987 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-08 15:17:48,988 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-08 15:17:49,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 15:17:49,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 15:17:49,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:17:49,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:17:49,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:17:49,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:17:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 15:17:49,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:17:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477981149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:17:49,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:17:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:17:49,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979132991] [2025-03-08 15:17:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:17:49,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:17:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:17:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:17:49,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:17:49,078 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 15:17:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:17:49,088 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2025-03-08 15:17:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:17:49,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2025-03-08 15:17:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:17:49,093 INFO L225 Difference]: With dead ends: 56 [2025-03-08 15:17:49,093 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 15:17:49,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 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-08 15:17:49,097 INFO L435 NwaCegarLoop]: 36 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, 36 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-08 15:17:49,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:17:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 15:17:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 15:17:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 15:17:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-08 15:17:49,118 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 45 [2025-03-08 15:17:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:17:49,119 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-08 15:17:49,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 15:17:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-03-08 15:17:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 15:17:49,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:17:49,120 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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-08 15:17:49,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:17:49,320 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-08 15:17:49,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:17:49,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:17:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1777482410, now seen corresponding path program 1 times [2025-03-08 15:17:49,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:17:49,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188010051] [2025-03-08 15:17:49,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:17:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:17:49,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 15:17:49,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 15:17:49,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:17:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:17:49,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:17:49,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 15:17:49,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 15:17:49,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:17:49,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:17:49,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:17:49,420 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:17:49,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:17:49,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:17:49,423 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 15:17:49,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:17:49,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:17:49 BoogieIcfgContainer [2025-03-08 15:17:49,445 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:17:49,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:17:49,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:17:49,446 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:17:49,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:17:48" (3/4) ... [2025-03-08 15:17:49,448 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:17:49,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:17:49,449 INFO L158 Benchmark]: Toolchain (without parser) took 1057.22ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 52.9MB in the end (delta: 60.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 15:17:49,449 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:17:49,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.27ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:17:49,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.84ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 981.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:17:49,450 INFO L158 Benchmark]: Boogie Preprocessor took 29.68ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:17:49,451 INFO L158 Benchmark]: IcfgBuilder took 172.34ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 87.5MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:17:49,451 INFO L158 Benchmark]: TraceAbstraction took 648.74ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 53.4MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 15:17:49,452 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 142.6MB. Free memory was 53.4MB in the beginning and 52.9MB in the end (delta: 490.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:17:49,453 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.27ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.84ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 981.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.68ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 172.34ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 87.5MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 648.74ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 53.4MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 142.6MB. Free memory was 53.4MB in the beginning and 52.9MB in the end (delta: 490.7kB). 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 49, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 34, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.5; [L23] double var_1_2 = 63.805; [L24] double var_1_3 = 64.125; [L25] unsigned short int var_1_4 = 16; [L26] float var_1_5 = 10.5; [L27] unsigned short int var_1_6 = 10; VAL [isInitial=0, var_1_1=511/2, var_1_2=12761/200, var_1_3=513/8, var_1_4=16, var_1_5=21/2, var_1_6=10] [L61] isInitial = 1 [L62] FCALL initially() [L63] COND TRUE 1 [L64] FCALL updateLastVariables() [L65] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_3=513/8, var_1_4=16, var_1_5=21/2, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_3=513/8, var_1_4=16, var_1_5=21/2, var_1_6=10] [L44] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=511/2, var_1_3=513/8, var_1_4=16, var_1_5=21/2, var_1_6=10] [L45] var_1_3 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_5=21/2, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_5=21/2, var_1_6=10] [L46] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=511/2, var_1_4=16, var_1_5=21/2, var_1_6=10] [L47] var_1_5 = __VERIFIER_nondet_float() [L48] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L48] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L49] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L49] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=10] [L50] var_1_6 = __VERIFIER_nondet_ushort() [L51] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16] [L51] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=511/2, var_1_4=16] [L52] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=65534] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=65534] [L52] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_1=511/2, var_1_4=16, var_1_6=65534] [L65] RET updateVariables() [L66] CALL step() [L31] COND TRUE ! (var_1_2 < var_1_3) [L32] var_1_1 = 1.4f VAL [isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] [L34] COND FALSE !(var_1_1 != (var_1_1 / var_1_5)) VAL [isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] [L66] RET step() [L67] CALL, EXPR property() [L57-L58] return ((! (var_1_2 < var_1_3)) ? (var_1_1 == ((float) 1.4f)) : 1) && ((var_1_1 != (var_1_1 / var_1_5)) ? ((var_1_1 < (var_1_5 * var_1_1)) ? (var_1_4 == ((unsigned short int) var_1_6)) : (var_1_4 == ((unsigned short int) var_1_6))) : 1) ; VAL [\result=0, isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] [L67] RET, EXPR property() [L67] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] [L19] reach_error() VAL [isInitial=1, var_1_1=7/5, var_1_4=16, var_1_6=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 47 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 36 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 110/120 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-08 15:17:49,469 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-86.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 248e9a660b5341ec0894e1aed13dbcc752507598fe574e15afae8cc67f5cac10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:17:51,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:17:51,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:17:51,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:17:51,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:17:51,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:17:51,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:17:51,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:17:51,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:17:51,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:17:51,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:17:51,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:17:51,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:17:51,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:17:51,278 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:17:51,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:17:51,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:17:51,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:17:51,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:17:51,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:17:51,280 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:17:51,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:17:51,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:17:51,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:17:51,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:17:51,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:17:51,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:17:51,281 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:17:51,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:17:51,281 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:17:51,281 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:17:51,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:17:51,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:17:51,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:17:51,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:17:51,282 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 -> 248e9a660b5341ec0894e1aed13dbcc752507598fe574e15afae8cc67f5cac10 [2025-03-08 15:17:51,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:17:51,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:17:51,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:17:51,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:17:51,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:17:51,535 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-86.i [2025-03-08 15:17:52,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ce484cf/0d643823c86f415eb7f5a3725297538a/FLAGccb27ea89 [2025-03-08 15:17:52,928 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:17:52,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-86.i [2025-03-08 15:17:52,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ce484cf/0d643823c86f415eb7f5a3725297538a/FLAGccb27ea89 [2025-03-08 15:17:53,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ce484cf/0d643823c86f415eb7f5a3725297538a [2025-03-08 15:17:53,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:17:53,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:17:53,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:17:53,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:17:53,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:17:53,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed92b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53, skipping insertion in model container [2025-03-08 15:17:53,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:17:53,395 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-86.i[915,928] [2025-03-08 15:17:53,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:17:53,426 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:17:53,433 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-86.i[915,928] [2025-03-08 15:17:53,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:17:53,450 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:17:53,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53 WrapperNode [2025-03-08 15:17:53,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:17:53,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:17:53,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:17:53,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:17:53,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,478 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 61 [2025-03-08 15:17:53,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:17:53,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:17:53,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:17:53,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:17:53,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,503 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-08 15:17:53,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:17:53,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:17:53,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:17:53,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:17:53,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (1/1) ... [2025-03-08 15:17:53,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:17:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:17:53,542 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-08 15:17:53,544 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-08 15:17:53,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:17:53,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:17:53,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:17:53,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:17:53,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:17:53,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:17:53,606 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:17:53,608 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:17:57,543 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:17:57,543 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:17:57,551 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:17:57,552 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:17:57,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:17:57 BoogieIcfgContainer [2025-03-08 15:17:57,553 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:17:57,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:17:57,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:17:57,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:17:57,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:17:53" (1/3) ... [2025-03-08 15:17:57,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3c8f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:17:57, skipping insertion in model container [2025-03-08 15:17:57,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:17:53" (2/3) ... [2025-03-08 15:17:57,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3c8f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:17:57, skipping insertion in model container [2025-03-08 15:17:57,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:17:57" (3/3) ... [2025-03-08 15:17:57,561 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-86.i [2025-03-08 15:17:57,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:17:57,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-86.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:17:57,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:17:57,613 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;@71ae8ebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:17:57,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:17:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 15:17:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 15:17:57,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:17:57,623 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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-08 15:17:57,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:17:57,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:17:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1341375704, now seen corresponding path program 1 times [2025-03-08 15:17:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:17:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656264494] [2025-03-08 15:17:57,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:17:57,633 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-08 15:17:57,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:17:57,635 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-08 15:17:57,636 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-08 15:17:57,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 15:17:57,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 15:17:57,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:17:57,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:17:57,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:17:57,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:17:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 15:17:57,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:17:57,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:17:57,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656264494] [2025-03-08 15:17:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656264494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:17:57,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:17:57,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:17:57,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144435552] [2025-03-08 15:17:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:17:57,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:17:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:17:57,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:17:57,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:17:57,860 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 15:17:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:17:57,870 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2025-03-08 15:17:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:17:57,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2025-03-08 15:17:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:17:57,875 INFO L225 Difference]: With dead ends: 56 [2025-03-08 15:17:57,875 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 15:17:57,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-08 15:17:57,878 INFO L435 NwaCegarLoop]: 36 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, 36 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-08 15:17:57,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:17:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 15:17:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 15:17:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 15:17:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-08 15:17:57,899 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 45 [2025-03-08 15:17:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:17:57,899 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-08 15:17:57,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 15:17:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-03-08 15:17:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 15:17:57,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:17:57,900 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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-08 15:17:57,909 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-08 15:17:58,104 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-08 15:17:58,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:17:58,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:17:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1777482410, now seen corresponding path program 1 times [2025-03-08 15:17:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:17:58,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8263349] [2025-03-08 15:17:58,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:17:58,105 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-08 15:17:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:17:58,108 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-08 15:17:58,109 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-08 15:17:58,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 15:17:58,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 15:17:58,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:17:58,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:17:58,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:17:58,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:18:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 15:18:06,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:18:06,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:18:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8263349] [2025-03-08 15:18:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8263349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:18:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:18:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:18:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730806373] [2025-03-08 15:18:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:18:06,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:18:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:18:06,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:18:06,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:18:06,888 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 15:18:07,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:18:19,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:18:28,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:18:42,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:18:46,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:18:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:18:48,098 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-03-08 15:18:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:18:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2025-03-08 15:18:48,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:18:48,100 INFO L225 Difference]: With dead ends: 69 [2025-03-08 15:18:48,100 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 15:18:48,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:18:48,101 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 57 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:18:48,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 170 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 29.5s Time] [2025-03-08 15:18:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 15:18:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2025-03-08 15:18:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 15:18:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2025-03-08 15:18:48,114 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 45 [2025-03-08 15:18:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:18:48,115 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2025-03-08 15:18:48,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 15:18:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2025-03-08 15:18:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 15:18:48,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:18:48,117 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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-08 15:18:48,124 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-08 15:18:48,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:18:48,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:18:48,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:18:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1748853259, now seen corresponding path program 1 times [2025-03-08 15:18:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:18:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87975998] [2025-03-08 15:18:48,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:18:48,319 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-08 15:18:48,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:18:48,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:18:48,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 15:18:48,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 15:18:48,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 15:18:48,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:18:48,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:18:48,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:18:48,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:19:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 15:19:04,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:19:04,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:19:04,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87975998] [2025-03-08 15:19:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87975998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:19:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952854928] [2025-03-08 15:19:04,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:04,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:19:04,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:19:04,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:19:04,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:19:04,909 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 15:19:06,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:19:09,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:19:12,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:19:14,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:19:15,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:19:16,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:19:26,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:19:35,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []