./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72e45e28aaf3935d4ca65e70373023686da7d793ee0ac4c17a38825789fb6009 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:30:54,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:30:54,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:30:54,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:30:54,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:30:54,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:30:54,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:30:54,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:30:54,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:30:54,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:30:54,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:30:54,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:30:54,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:30:54,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:30:54,190 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:30:54,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:30:54,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:30:54,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:30:54,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:30:54,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:54,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:54,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:54,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:54,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:30:54,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:54,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:54,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:54,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:30:54,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:30:54,194 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72e45e28aaf3935d4ca65e70373023686da7d793ee0ac4c17a38825789fb6009 [2025-01-09 14:30:54,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:30:54,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:30:54,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:30:54,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:30:54,436 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:30:54,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i [2025-01-09 14:30:55,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e70008c/fe3470ab920d4db6922274f060ba7548/FLAG01cd9778d [2025-01-09 14:30:55,814 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:30:55,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i [2025-01-09 14:30:55,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e70008c/fe3470ab920d4db6922274f060ba7548/FLAG01cd9778d [2025-01-09 14:30:56,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e70008c/fe3470ab920d4db6922274f060ba7548 [2025-01-09 14:30:56,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:30:56,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:30:56,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:30:56,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:30:56,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:30:56,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d36fc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56, skipping insertion in model container [2025-01-09 14:30:56,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:30:56,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i[914,927] [2025-01-09 14:30:56,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:30:56,298 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:30:56,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i[914,927] [2025-01-09 14:30:56,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:30:56,336 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:30:56,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56 WrapperNode [2025-01-09 14:30:56,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:30:56,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:30:56,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:30:56,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:30:56,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,368 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-01-09 14:30:56,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:30:56,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:30:56,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:30:56,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:30:56,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,388 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:30:56,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:30:56,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:30:56,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:30:56,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:30:56,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (1/1) ... [2025-01-09 14:30:56,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:56,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:56,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:30:56,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:30:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:30:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:30:56,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:30:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:30:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:30:56,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:30:56,508 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:30:56,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:30:56,623 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:30:56,624 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:30:56,632 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:30:56,632 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:30:56,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:56 BoogieIcfgContainer [2025-01-09 14:30:56,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:30:56,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:30:56,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:30:56,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:30:56,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:30:56" (1/3) ... [2025-01-09 14:30:56,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645ec256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:30:56, skipping insertion in model container [2025-01-09 14:30:56,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:56" (2/3) ... [2025-01-09 14:30:56,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645ec256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:30:56, skipping insertion in model container [2025-01-09 14:30:56,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:56" (3/3) ... [2025-01-09 14:30:56,640 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-0.i [2025-01-09 14:30:56,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:30:56,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-0.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:30:56,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:30:56,713 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;@287c885c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:30:56,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:30:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:30:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 14:30:56,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:56,722 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:56,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:56,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1884145557, now seen corresponding path program 1 times [2025-01-09 14:30:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:56,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002171418] [2025-01-09 14:30:56,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:56,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:56,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:30:56,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:30:56,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:56,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 14:30:56,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002171418] [2025-01-09 14:30:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002171418] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778161859] [2025-01-09 14:30:56,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:56,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:56,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:56,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:30:56,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:30:56,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:30:56,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:30:56,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:56,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:56,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:30:56,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 14:30:57,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:30:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778161859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:57,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:57,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:30:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690595531] [2025-01-09 14:30:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:57,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:30:57,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:57,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:30:57,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:30:57,034 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:30:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:57,049 INFO L93 Difference]: Finished difference Result 80 states and 124 transitions. [2025-01-09 14:30:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:30:57,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-01-09 14:30:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:57,055 INFO L225 Difference]: With dead ends: 80 [2025-01-09 14:30:57,055 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 14:30:57,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:30:57,058 INFO L435 NwaCegarLoop]: 55 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, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:57,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 14:30:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 14:30:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:30:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-01-09 14:30:57,080 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 66 [2025-01-09 14:30:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:57,080 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-01-09 14:30:57,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:30:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-01-09 14:30:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 14:30:57,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:57,082 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:57,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:30:57,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:30:57,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:57,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash -88086291, now seen corresponding path program 1 times [2025-01-09 14:30:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:57,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062374237] [2025-01-09 14:30:57,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:57,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:30:57,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:30:57,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:57,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 14:30:57,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062374237] [2025-01-09 14:30:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062374237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:57,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:30:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113343090] [2025-01-09 14:30:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:30:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:30:57,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:57,424 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:30:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:57,453 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2025-01-09 14:30:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:30:57,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2025-01-09 14:30:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:57,455 INFO L225 Difference]: With dead ends: 90 [2025-01-09 14:30:57,455 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 14:30:57,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:57,456 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:57,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 96 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 14:30:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2025-01-09 14:30:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:30:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-01-09 14:30:57,464 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 66 [2025-01-09 14:30:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:57,465 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-01-09 14:30:57,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:30:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-01-09 14:30:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 14:30:57,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:57,466 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:30:57,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:30:57,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:57,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash -768144661, now seen corresponding path program 1 times [2025-01-09 14:30:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792113782] [2025-01-09 14:30:57,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:57,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:30:57,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:30:57,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:57,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:30:57,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:30:57,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:30:57,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:30:57,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:57,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:30:57,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:30:57,540 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:30:57,541 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:30:57,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:30:57,544 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:30:57,567 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:30:57,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:30:57 BoogieIcfgContainer [2025-01-09 14:30:57,572 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:30:57,573 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:30:57,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:30:57,574 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:30:57,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:56" (3/4) ... [2025-01-09 14:30:57,576 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:30:57,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:30:57,577 INFO L158 Benchmark]: Toolchain (without parser) took 1431.64ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 35.3MB in the end (delta: 85.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-09 14:30:57,577 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:30:57,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.00ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 109.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:30:57,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.65ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:30:57,579 INFO L158 Benchmark]: Boogie Preprocessor took 35.56ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 105.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:30:57,579 INFO L158 Benchmark]: RCFGBuilder took 227.64ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 92.2MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:30:57,579 INFO L158 Benchmark]: TraceAbstraction took 938.37ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 35.6MB in the end (delta: 56.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 14:30:57,579 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 167.8MB. Free memory was 35.6MB in the beginning and 35.3MB in the end (delta: 311.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:30:57,580 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.19ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.00ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 109.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.65ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.56ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 105.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 227.64ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 92.2MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 938.37ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 35.6MB in the end (delta: 56.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 167.8MB. Free memory was 35.6MB in the beginning and 35.3MB in the end (delta: 311.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 25.8; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 128.2; [L25] double var_1_4 = 15.4; [L26] double var_1_5 = 5.25; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 8.125; [L29] float var_1_8 = 0.4; [L30] float var_1_9 = 499.4; [L31] float var_1_10 = 63.16; VAL [isInitial=0, var_1_10=1579/25, var_1_1=129/5, var_1_2=1, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L86] isInitial = 1 [L87] FCALL initially() [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L63] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L64] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L64] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L65] var_1_3 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L66] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L67] var_1_4 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L68] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L72] var_1_8 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L73] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L74] var_1_9 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L75] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L76] var_1_10 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L77] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L90] RET updateVariables() [L91] CALL step() [L35] COND TRUE ! var_1_2 [L36] var_1_1 = (var_1_3 - var_1_4) VAL [isInitial=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L40] unsigned char stepLocal_0 = var_1_4 < var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L41] COND FALSE !(stepLocal_0 || var_1_2) VAL [isInitial=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L48] unsigned char stepLocal_1 = var_1_1 <= (var_1_1 + var_1_3); VAL [isInitial=1, stepLocal_1=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L49] COND TRUE var_1_2 || stepLocal_1 [L50] var_1_7 = ((((5.5f) < (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3))))) ? (5.5f) : (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3)))))) VAL [isInitial=1, var_1_2=0, var_1_3=642/5, var_1_5=21/4, var_1_6=1, var_1_7=642/5] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return (((! var_1_2) ? (var_1_1 == ((double) (var_1_3 - var_1_4))) : (var_1_1 == ((double) ((((16.2) < (var_1_3)) ? (16.2) : (var_1_3)))))) && (((var_1_4 < var_1_3) || var_1_2) ? (var_1_2 ? (var_1_6 ? (var_1_5 == ((double) var_1_3)) : 1) : 1) : 1)) && ((var_1_2 || (var_1_1 <= (var_1_1 + var_1_3))) ? (var_1_7 == ((float) ((((5.5f) < (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3))))) ? (5.5f) : (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3)))))))) : (var_1_6 ? (var_1_7 == ((float) ((var_1_8 - var_1_9) + var_1_10))) : (var_1_2 ? (var_1_7 == ((float) var_1_9)) : 1))) ; VAL [\result=0, isInitial=1, var_1_2=0, var_1_3=642/5, var_1_5=21/4, var_1_6=1, var_1_7=642/5] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_2=0, var_1_3=642/5, var_1_5=21/4, var_1_6=1, var_1_7=642/5] [L19] reach_error() VAL [isInitial=1, var_1_2=0, var_1_3=642/5, var_1_5=21/4, var_1_6=1, var_1_7=642/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 114 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 416/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:30:57,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72e45e28aaf3935d4ca65e70373023686da7d793ee0ac4c17a38825789fb6009 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:30:59,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:30:59,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:30:59,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:30:59,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:30:59,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:30:59,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:30:59,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:30:59,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:30:59,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:30:59,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:30:59,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:30:59,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:30:59,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:30:59,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:30:59,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:30:59,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:59,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:59,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:59,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:30:59,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:30:59,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:30:59,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:30:59,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:30:59,570 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72e45e28aaf3935d4ca65e70373023686da7d793ee0ac4c17a38825789fb6009 [2025-01-09 14:30:59,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:30:59,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:30:59,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:30:59,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:30:59,809 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:30:59,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i [2025-01-09 14:31:00,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/469566b16/437066a1b62e449596f5932e2a88acb0/FLAG7d62fc71f [2025-01-09 14:31:01,158 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:31:01,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i [2025-01-09 14:31:01,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/469566b16/437066a1b62e449596f5932e2a88acb0/FLAG7d62fc71f [2025-01-09 14:31:01,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/469566b16/437066a1b62e449596f5932e2a88acb0 [2025-01-09 14:31:01,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:31:01,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:31:01,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:01,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:31:01,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:31:01,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f5b11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01, skipping insertion in model container [2025-01-09 14:31:01,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:31:01,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i[914,927] [2025-01-09 14:31:01,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:01,700 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:31:01,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-0.i[914,927] [2025-01-09 14:31:01,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:01,738 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:31:01,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01 WrapperNode [2025-01-09 14:31:01,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:01,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:01,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:31:01,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:31:01,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,768 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-01-09 14:31:01,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:01,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:31:01,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:31:01,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:31:01,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,786 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:31:01,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:31:01,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:31:01,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:31:01,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:31:01,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (1/1) ... [2025-01-09 14:31:01,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:01,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:01,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:31:01,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:31:01,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:31:01,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:31:01,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:31:01,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:31:01,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:31:01,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:31:01,925 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:31:01,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:31:05,760 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:31:05,761 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:31:05,767 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:31:05,767 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:31:05,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:05 BoogieIcfgContainer [2025-01-09 14:31:05,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:31:05,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:31:05,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:31:05,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:31:05,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:31:01" (1/3) ... [2025-01-09 14:31:05,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60259c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:05, skipping insertion in model container [2025-01-09 14:31:05,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:01" (2/3) ... [2025-01-09 14:31:05,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60259c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:05, skipping insertion in model container [2025-01-09 14:31:05,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:05" (3/3) ... [2025-01-09 14:31:05,775 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-0.i [2025-01-09 14:31:05,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:31:05,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-0.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:31:05,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:31:05,824 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;@69a0ca9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:31:05,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:31:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:31:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 14:31:05,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:05,833 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:05,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:05,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1884145557, now seen corresponding path program 1 times [2025-01-09 14:31:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:31:05,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394020156] [2025-01-09 14:31:05,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:05,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:05,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:31:05,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:31:05,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 14:31:05,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:31:06,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:31:06,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:06,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:06,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:31:06,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 14:31:06,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:06,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:31:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394020156] [2025-01-09 14:31:06,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394020156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:06,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:31:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220396990] [2025-01-09 14:31:06,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:31:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:31:06,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:31:06,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:06,282 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:31:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:06,302 INFO L93 Difference]: Finished difference Result 80 states and 124 transitions. [2025-01-09 14:31:06,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:31:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-01-09 14:31:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:06,310 INFO L225 Difference]: With dead ends: 80 [2025-01-09 14:31:06,311 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 14:31:06,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:06,317 INFO L435 NwaCegarLoop]: 55 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, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:06,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:31:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 14:31:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 14:31:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:31:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-01-09 14:31:06,348 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 66 [2025-01-09 14:31:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:06,349 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-01-09 14:31:06,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 14:31:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-01-09 14:31:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 14:31:06,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:06,351 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:06,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 14:31:06,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:06,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:06,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash -88086291, now seen corresponding path program 1 times [2025-01-09 14:31:06,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:31:06,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296701360] [2025-01-09 14:31:06,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:06,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:06,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:31:06,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:31:06,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 14:31:06,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:31:06,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:31:06,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:06,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:06,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:31:06,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 14:31:06,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:06,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:31:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296701360] [2025-01-09 14:31:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296701360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:06,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:06,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:31:06,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782754315] [2025-01-09 14:31:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:06,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:31:06,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:31:06,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:31:06,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:31:06,938 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:31:09,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:31:12,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:31:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:12,174 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2025-01-09 14:31:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:31:12,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2025-01-09 14:31:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:12,195 INFO L225 Difference]: With dead ends: 90 [2025-01-09 14:31:12,195 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 14:31:12,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:31:12,196 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:12,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 14:31:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 14:31:12,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2025-01-09 14:31:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 14:31:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-01-09 14:31:12,202 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 66 [2025-01-09 14:31:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:12,203 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-01-09 14:31:12,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 14:31:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-01-09 14:31:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 14:31:12,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:12,204 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:31:12,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 14:31:12,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:12,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:12,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash -768144661, now seen corresponding path program 1 times [2025-01-09 14:31:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:31:12,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417256741] [2025-01-09 14:31:12,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:12,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:31:12,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:31:12,414 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:31:12,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 14:31:12,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:31:12,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:31:12,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:12,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:12,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:31:12,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:44,871 WARN L286 SmtUtils]: Spent 16.35s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 14:31:57,195 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:32:20,889 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)