./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.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_amount10_file-71.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 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:18:05,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:18:05,560 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:18:05,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:18:05,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:18:05,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:18:05,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:18:05,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:18:05,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:18:05,579 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:18:05,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:18:05,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:18:05,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:18:05,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:18:05,580 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:18:05,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:18:05,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:18:05,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:18:05,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:18:05,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:18:05,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:18:05,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:05,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:05,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:18:05,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:18:05,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:18:05,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:18:05,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:18:05,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:18:05,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:18:05,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:18:05,583 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 -> 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 [2025-01-09 14:18:05,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:18:05,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:18:05,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:18:05,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:18:05,766 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:18:05,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-01-09 14:18:06,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6c68c9bb/7de65f0ca1ca4ba99a3b362f9f5921d8/FLAG115d4b5ba [2025-01-09 14:18:07,082 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:18:07,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-01-09 14:18:07,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6c68c9bb/7de65f0ca1ca4ba99a3b362f9f5921d8/FLAG115d4b5ba [2025-01-09 14:18:07,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6c68c9bb/7de65f0ca1ca4ba99a3b362f9f5921d8 [2025-01-09 14:18:07,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:18:07,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:18:07,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:18:07,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:18:07,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:18:07,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186b46e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07, skipping insertion in model container [2025-01-09 14:18:07,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:18:07,531 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_amount10_file-71.i[915,928] [2025-01-09 14:18:07,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:18:07,562 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:18:07,569 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_amount10_file-71.i[915,928] [2025-01-09 14:18:07,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:18:07,588 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:18:07,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07 WrapperNode [2025-01-09 14:18:07,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:18:07,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:18:07,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:18:07,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:18:07,596 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:18:07" (1/1) ... [2025-01-09 14:18:07,602 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:18:07" (1/1) ... [2025-01-09 14:18:07,614 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-01-09 14:18:07,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:18:07,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:18:07,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:18:07,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:18:07,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,629 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:18:07,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:18:07,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:18:07,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:18:07,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:18:07,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (1/1) ... [2025-01-09 14:18:07,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:07,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:18:07,671 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:18:07,680 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:18:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:18:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:18:07,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:18:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:18:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:18:07,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:18:07,738 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:18:07,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:18:07,849 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:18:07,852 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:18:07,860 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:18:07,860 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:18:07,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:07 BoogieIcfgContainer [2025-01-09 14:18:07,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:18:07,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:18:07,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:18:07,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:18:07,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:18:07" (1/3) ... [2025-01-09 14:18:07,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9170cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:18:07, skipping insertion in model container [2025-01-09 14:18:07,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:07" (2/3) ... [2025-01-09 14:18:07,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9170cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:18:07, skipping insertion in model container [2025-01-09 14:18:07,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:07" (3/3) ... [2025-01-09 14:18:07,868 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-71.i [2025-01-09 14:18:07,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:18:07,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-71.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:18:07,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:18:07,935 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;@12eeea0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:18:07,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:18:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:18:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 14:18:07,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:07,946 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:07,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:07,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1114480968, now seen corresponding path program 1 times [2025-01-09 14:18:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:18:07,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393069678] [2025-01-09 14:18:07,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:18:08,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 14:18:08,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 14:18:08,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:08,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:18:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:18:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393069678] [2025-01-09 14:18:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393069678] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:18:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261723485] [2025-01-09 14:18:08,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:18:08,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:18:08,131 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:18:08,132 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:18:08,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 14:18:08,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 14:18:08,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:08,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:08,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:18:08,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:18:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:18:08,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:18:08,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261723485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:18:08,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:18:08,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:18:08,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298160356] [2025-01-09 14:18:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:18:08,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:18:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:18:08,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:18:08,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:18:08,254 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:18:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:08,268 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2025-01-09 14:18:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:18:08,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-01-09 14:18:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:08,273 INFO L225 Difference]: With dead ends: 76 [2025-01-09 14:18:08,273 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 14:18:08,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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:18:08,277 INFO L435 NwaCegarLoop]: 52 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, 52 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:18:08,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:18:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 14:18:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 14:18:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:18:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-01-09 14:18:08,299 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 79 [2025-01-09 14:18:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-01-09 14:18:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:18:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2025-01-09 14:18:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 14:18:08,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:08,301 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:08,307 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:18:08,506 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:18:08,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:08,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1799227712, now seen corresponding path program 1 times [2025-01-09 14:18:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:18:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628452870] [2025-01-09 14:18:08,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:18:08,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 14:18:08,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 14:18:08,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:08,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:18:08,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:18:08,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 14:18:08,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 14:18:08,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:08,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:18:08,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:18:08,615 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:18:08,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:18:08,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:18:08,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 14:18:08,665 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:18:08,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:18:08 BoogieIcfgContainer [2025-01-09 14:18:08,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:18:08,667 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:18:08,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:18:08,668 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:18:08,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:07" (3/4) ... [2025-01-09 14:18:08,669 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:18:08,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:18:08,671 INFO L158 Benchmark]: Toolchain (without parser) took 1252.63ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 111.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2025-01-09 14:18:08,671 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:08,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.55ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:08,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.08ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:08,672 INFO L158 Benchmark]: Boogie Preprocessor took 25.06ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:08,672 INFO L158 Benchmark]: RCFGBuilder took 220.30ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 85.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:08,672 INFO L158 Benchmark]: TraceAbstraction took 805.23ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 111.1MB in the end (delta: -27.2MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2025-01-09 14:18:08,672 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 111.1MB in the end (delta: 63.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:08,674 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.55ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.08ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.06ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 220.30ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 85.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 805.23ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 111.1MB in the end (delta: -27.2MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 111.1MB in the end (delta: 63.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 31.25; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 0.25; [L26] float var_1_5 = 10.5; [L27] unsigned char var_1_6 = 16; [L28] double var_1_7 = 10.75; [L29] double var_1_8 = 2.675; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 2; VAL [isInitial=0, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L73] isInitial = 1 [L74] FCALL initially() [L76] FCALL updateLastVariables() [L77] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L48] var_1_3 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L50] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L50] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L51] var_1_4 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L52] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L53] var_1_5 = __VERIFIER_nondet_float() [L54] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L54] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L55] var_1_7 = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L56] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L57] var_1_8 = __VERIFIER_nondet_double() [L58] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L58] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L59] var_1_9 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L60] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L61] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L61] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L62] var_1_10 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L63] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L64] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L64] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L77] RET updateVariables() [L78] CALL step() [L35] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L40] COND FALSE !((var_1_7 - var_1_8) >= (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L78] RET step() [L79] CALL, EXPR property() [L69-L70] return (var_1_2 ? (var_1_3 ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) : 1) && (((var_1_7 - var_1_8) >= (var_1_1 + var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_9 - var_1_10))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L79] RET, EXPR property() [L79] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L19] reach_error() VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 52 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 506/528 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:18:08,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_amount10_file-71.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 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:18:10,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:18:10,677 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:18:10,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:18:10,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:18:10,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:18:10,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:18:10,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:18:10,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:18:10,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:18:10,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:18:10,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:18:10,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:18:10,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:10,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:18:10,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:10,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:18:10,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:18:10,714 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 -> 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 [2025-01-09 14:18:10,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:18:10,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:18:10,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:18:10,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:18:10,963 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:18:10,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-01-09 14:18:12,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0107e9553/7c2042d797474df3abb514918e880c1d/FLAGb3692a0a2 [2025-01-09 14:18:12,396 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:18:12,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-01-09 14:18:12,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0107e9553/7c2042d797474df3abb514918e880c1d/FLAGb3692a0a2 [2025-01-09 14:18:12,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0107e9553/7c2042d797474df3abb514918e880c1d [2025-01-09 14:18:12,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:18:12,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:18:12,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:18:12,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:18:12,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:18:12,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:12,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab1799c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12, skipping insertion in model container [2025-01-09 14:18:12,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:12,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:18:12,883 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_amount10_file-71.i[915,928] [2025-01-09 14:18:12,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:18:12,924 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:18:12,933 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_amount10_file-71.i[915,928] [2025-01-09 14:18:12,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:18:12,961 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:18:12,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12 WrapperNode [2025-01-09 14:18:12,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:18:12,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:18:12,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:18:12,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:18:12,967 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:18:12" (1/1) ... [2025-01-09 14:18:12,974 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:18:12" (1/1) ... [2025-01-09 14:18:12,987 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-01-09 14:18:12,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:18:12,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:18:12,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:18:12,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:18:12,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:12,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:12,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,004 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:18:13,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:18:13,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:18:13,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:18:13,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:18:13,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (1/1) ... [2025-01-09 14:18:13,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:13,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:18:13,052 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:18:13,057 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:18:13,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:18:13,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:18:13,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:18:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:18:13,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:18:13,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:18:13,121 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:18:13,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:18:14,822 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:18:14,822 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:18:14,828 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:18:14,829 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:18:14,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:14 BoogieIcfgContainer [2025-01-09 14:18:14,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:18:14,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:18:14,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:18:14,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:18:14,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:18:12" (1/3) ... [2025-01-09 14:18:14,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfbb9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:18:14, skipping insertion in model container [2025-01-09 14:18:14,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:12" (2/3) ... [2025-01-09 14:18:14,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfbb9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:18:14, skipping insertion in model container [2025-01-09 14:18:14,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:14" (3/3) ... [2025-01-09 14:18:14,838 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-71.i [2025-01-09 14:18:14,847 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:18:14,848 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-71.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:18:14,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:18:14,898 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;@15c702e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:18:14,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:18:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:18:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 14:18:14,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:14,908 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:14,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:14,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1114480968, now seen corresponding path program 1 times [2025-01-09 14:18:14,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:18:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172055073] [2025-01-09 14:18:14,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:14,921 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:18:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:18:14,924 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:18:14,926 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:18:14,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 14:18:15,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 14:18:15,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:15,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:15,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:18:15,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:18:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 14:18:15,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:18:15,153 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:18:15,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172055073] [2025-01-09 14:18:15,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172055073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:18:15,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:18:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:18:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95721088] [2025-01-09 14:18:15,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:18:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:18:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:18:15,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:18:15,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:18:15,169 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:18:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:15,185 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2025-01-09 14:18:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:18:15,186 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-01-09 14:18:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:15,192 INFO L225 Difference]: With dead ends: 76 [2025-01-09 14:18:15,192 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 14:18:15,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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:18:15,199 INFO L435 NwaCegarLoop]: 52 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, 52 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:18:15,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:18:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 14:18:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 14:18:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:18:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-01-09 14:18:15,230 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 79 [2025-01-09 14:18:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:15,230 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-01-09 14:18:15,230 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:18:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2025-01-09 14:18:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 14:18:15,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:15,234 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,246 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 14:18:15,434 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:18:15,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:15,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1799227712, now seen corresponding path program 1 times [2025-01-09 14:18:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:18:15,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114713520] [2025-01-09 14:18:15,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:15,437 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:18:15,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:18:15,441 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:18:15,444 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:18:15,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 14:18:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 14:18:15,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:15,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:15,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:18:15,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:18:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:18:36,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:18:36,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:18:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114713520] [2025-01-09 14:18:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114713520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:18:36,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:18:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:18:36,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541115596] [2025-01-09 14:18:36,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:18:36,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:18:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:18:36,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:18:36,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:18:36,625 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:18:46,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:18:52,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:18:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:58,948 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-01-09 14:18:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:18:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2025-01-09 14:18:58,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:58,960 INFO L225 Difference]: With dead ends: 55 [2025-01-09 14:18:58,960 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 14:18:58,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:18:58,961 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:18:58,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 221 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2025-01-09 14:18:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 14:18:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2025-01-09 14:18:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:18:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-01-09 14:18:58,974 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 79 [2025-01-09 14:18:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:58,975 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-01-09 14:18:58,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:18:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-01-09 14:18:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 14:18:58,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:58,979 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:58,985 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 14:18:59,179 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:18:59,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1797380670, now seen corresponding path program 1 times [2025-01-09 14:18:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:18:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182742606] [2025-01-09 14:18:59,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:59,181 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:18:59,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:18:59,183 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:18:59,183 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:18:59,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 14:18:59,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 14:18:59,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:59,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:59,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:18:59,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:19:09,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:09,265 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:19:09,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182742606] [2025-01-09 14:19:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182742606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:09,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:19:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154765703] [2025-01-09 14:19:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:19:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:19:09,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:19:09,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:19:09,267 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:19:10,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:19:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:11,500 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2025-01-09 14:19:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:19:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2025-01-09 14:19:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:11,502 INFO L225 Difference]: With dead ends: 53 [2025-01-09 14:19:11,502 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 14:19:11,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:19:11,502 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 13 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:11,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 206 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 14:19:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 14:19:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2025-01-09 14:19:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:19:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-01-09 14:19:11,510 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 79 [2025-01-09 14:19:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:11,510 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-01-09 14:19:11,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:19:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-01-09 14:19:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 14:19:11,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:11,511 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:11,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 14:19:11,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:19:11,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:11,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1114559195, now seen corresponding path program 1 times [2025-01-09 14:19:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:19:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203249222] [2025-01-09 14:19:11,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:11,713 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:19:11,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:19:11,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:19:11,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 14:19:11,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 14:19:11,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 14:19:11,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:11,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:11,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:19:11,884 INFO L279 TraceCheckSpWp]: Computing forward predicates...