./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7769f6e88057884e9f756ce4db3366a3e684d2e94a6b3544a7e6cd1c830e602 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:25:41,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:25:42,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:25:42,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:25:42,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:25:42,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:25:42,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:25:42,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:25:42,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:25:42,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:25:42,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:25:42,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:25:42,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:25:42,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:25:42,070 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:25:42,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:25:42,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:25:42,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:25:42,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:25:42,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7769f6e88057884e9f756ce4db3366a3e684d2e94a6b3544a7e6cd1c830e602 [2025-03-04 00:25:42,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:25:42,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:25:42,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:25:42,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:25:42,277 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:25:42,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i [2025-03-04 00:25:43,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c0ef21e/635a6aee4a8a482a8cb5bb2d84dcc6e7/FLAGbff9b94f4 [2025-03-04 00:25:43,667 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:25:43,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i [2025-03-04 00:25:43,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c0ef21e/635a6aee4a8a482a8cb5bb2d84dcc6e7/FLAGbff9b94f4 [2025-03-04 00:25:43,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c0ef21e/635a6aee4a8a482a8cb5bb2d84dcc6e7 [2025-03-04 00:25:43,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:25:43,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:25:43,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:25:43,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:25:43,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:25:43,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fbaa0e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43, skipping insertion in model container [2025-03-04 00:25:43,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:25:43,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i[915,928] [2025-03-04 00:25:43,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:25:43,869 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:25:43,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i[915,928] [2025-03-04 00:25:43,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:25:43,912 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:25:43,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43 WrapperNode [2025-03-04 00:25:43,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:25:43,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:25:43,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:25:43,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:25:43,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,940 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-04 00:25:43,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:25:43,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:25:43,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:25:43,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:25:43,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:25:43,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:25:43,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:25:43,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:25:43,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:25:43,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (1/1) ... [2025-03-04 00:25:43,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:25:43,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:25:44,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:25:44,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:25:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:25:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:25:44,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:25:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:25:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:25:44,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:25:44,074 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:25:44,075 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:25:44,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-04 00:25:44,269 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:25:44,269 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:25:44,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:25:44,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:25:44,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:25:44 BoogieIcfgContainer [2025-03-04 00:25:44,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:25:44,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:25:44,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:25:44,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:25:44,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:25:43" (1/3) ... [2025-03-04 00:25:44,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fec38ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:25:44, skipping insertion in model container [2025-03-04 00:25:44,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:43" (2/3) ... [2025-03-04 00:25:44,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fec38ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:25:44, skipping insertion in model container [2025-03-04 00:25:44,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:25:44" (3/3) ... [2025-03-04 00:25:44,292 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-71.i [2025-03-04 00:25:44,301 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:25:44,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-71.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:25:44,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:25:44,351 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;@a9fd648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:25:44,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:25:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:25:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 00:25:44,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:44,362 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:44,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:44,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1267902943, now seen corresponding path program 1 times [2025-03-04 00:25:44,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273235343] [2025-03-04 00:25:44,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:44,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 00:25:44,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 00:25:44,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 00:25:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:25:44,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273235343] [2025-03-04 00:25:44,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273235343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:25:44,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251119360] [2025-03-04 00:25:44,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:44,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:25:44,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:25:44,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:25:44,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:25:44,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 00:25:44,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 00:25:44,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:44,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:44,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:25:44,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:25:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 00:25:44,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:25:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251119360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:25:44,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:25:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:25:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362959428] [2025-03-04 00:25:44,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:25:44,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:25:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:25:44,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:25:44,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:25:44,709 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:25:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:44,725 INFO L93 Difference]: Finished difference Result 104 states and 168 transitions. [2025-03-04 00:25:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:25:44,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2025-03-04 00:25:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:44,731 INFO L225 Difference]: With dead ends: 104 [2025-03-04 00:25:44,731 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:25:44,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:25:44,734 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:25:44,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:25:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:25:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:25:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:25:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-04 00:25:44,774 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 99 [2025-03-04 00:25:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-04 00:25:44,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:25:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-03-04 00:25:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 00:25:44,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:44,778 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:44,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:25:44,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:25:44,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:44,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2086253886, now seen corresponding path program 1 times [2025-03-04 00:25:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:44,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348698677] [2025-03-04 00:25:44,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 00:25:45,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 00:25:45,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:45,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 00:25:45,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:25:45,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348698677] [2025-03-04 00:25:45,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348698677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:25:45,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:25:45,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:25:45,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787054512] [2025-03-04 00:25:45,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:25:45,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:25:45,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:25:45,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:25:45,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:25:45,385 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:45,463 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2025-03-04 00:25:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:25:45,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2025-03-04 00:25:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:45,466 INFO L225 Difference]: With dead ends: 106 [2025-03-04 00:25:45,466 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 00:25:45,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:25:45,466 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:25:45,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:25:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 00:25:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 00:25:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:25:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2025-03-04 00:25:45,481 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 99 [2025-03-04 00:25:45,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:45,481 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2025-03-04 00:25:45,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2025-03-04 00:25:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 00:25:45,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:45,482 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:45,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:25:45,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:45,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash -570760498, now seen corresponding path program 1 times [2025-03-04 00:25:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:45,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251963939] [2025-03-04 00:25:45,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:45,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 00:25:45,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 00:25:45,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:45,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 00:25:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:25:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251963939] [2025-03-04 00:25:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251963939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:25:45,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:25:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:25:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121067082] [2025-03-04 00:25:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:25:45,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:25:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:25:45,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:25:45,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:25:45,959 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:46,085 INFO L93 Difference]: Finished difference Result 130 states and 177 transitions. [2025-03-04 00:25:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:25:46,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-03-04 00:25:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:46,089 INFO L225 Difference]: With dead ends: 130 [2025-03-04 00:25:46,089 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 00:25:46,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:25:46,090 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:25:46,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:25:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 00:25:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2025-03-04 00:25:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:25:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2025-03-04 00:25:46,102 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 100 [2025-03-04 00:25:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:46,103 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2025-03-04 00:25:46,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2025-03-04 00:25:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 00:25:46,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:46,104 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:46,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:25:46,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 840118454, now seen corresponding path program 1 times [2025-03-04 00:25:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557999697] [2025-03-04 00:25:46,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:46,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 00:25:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 00:25:46,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 00:25:46,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:25:46,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557999697] [2025-03-04 00:25:46,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557999697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:25:46,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:25:46,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:25:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456548842] [2025-03-04 00:25:46,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:25:46,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:25:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:25:46,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:25:46,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:25:46,487 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:46,597 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2025-03-04 00:25:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:25:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-03-04 00:25:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:46,600 INFO L225 Difference]: With dead ends: 157 [2025-03-04 00:25:46,600 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 00:25:46,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:25:46,602 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 43 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:25:46,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 437 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:25:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 00:25:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 65. [2025-03-04 00:25:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:25:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2025-03-04 00:25:46,613 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 101 [2025-03-04 00:25:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:46,614 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2025-03-04 00:25:46,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2025-03-04 00:25:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 00:25:46,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:46,616 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:46,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:25:46,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:46,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2070592146, now seen corresponding path program 1 times [2025-03-04 00:25:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413507982] [2025-03-04 00:25:46,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:46,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 00:25:46,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 00:25:46,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:46,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 00:25:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:25:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413507982] [2025-03-04 00:25:46,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413507982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:25:46,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:25:46,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:25:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515331308] [2025-03-04 00:25:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:25:46,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:25:46,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:25:46,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:25:46,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:25:46,670 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:46,703 INFO L93 Difference]: Finished difference Result 161 states and 218 transitions. [2025-03-04 00:25:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:25:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-04 00:25:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:46,705 INFO L225 Difference]: With dead ends: 161 [2025-03-04 00:25:46,705 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 00:25:46,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:25:46,705 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 46 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:25:46,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 170 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:25:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 00:25:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-03-04 00:25:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.196969696969697) internal successors, (79), 67 states have internal predecessors, (79), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 00:25:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2025-03-04 00:25:46,724 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 102 [2025-03-04 00:25:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:46,724 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2025-03-04 00:25:46,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2025-03-04 00:25:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 00:25:46,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:46,728 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:46,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:25:46,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:46,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1336871469, now seen corresponding path program 1 times [2025-03-04 00:25:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728505153] [2025-03-04 00:25:46,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:46,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 00:25:46,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 00:25:46,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:46,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 00:25:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:25:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728505153] [2025-03-04 00:25:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728505153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:25:47,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:25:47,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:25:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456041423] [2025-03-04 00:25:47,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:25:47,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:25:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:25:47,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:25:47,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:25:47,266 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:47,461 INFO L93 Difference]: Finished difference Result 210 states and 279 transitions. [2025-03-04 00:25:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:25:47,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-04 00:25:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:47,463 INFO L225 Difference]: With dead ends: 210 [2025-03-04 00:25:47,464 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 00:25:47,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:25:47,464 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 61 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:25:47,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 496 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:25:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 00:25:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2025-03-04 00:25:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 67 states have internal predecessors, (78), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 00:25:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 128 transitions. [2025-03-04 00:25:47,473 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 128 transitions. Word has length 102 [2025-03-04 00:25:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 128 transitions. [2025-03-04 00:25:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:25:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 128 transitions. [2025-03-04 00:25:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 00:25:47,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:47,474 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:47,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:25:47,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:47,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash 428576076, now seen corresponding path program 1 times [2025-03-04 00:25:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:47,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963537352] [2025-03-04 00:25:47,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:47,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 00:25:47,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 00:25:47,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:47,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:25:47,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:25:47,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 00:25:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 00:25:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:25:47,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:25:47,536 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:25:47,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:25:47,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:25:47,541 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:47,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:25:47,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:25:47 BoogieIcfgContainer [2025-03-04 00:25:47,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:25:47,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:25:47,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:25:47,596 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:25:47,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:25:44" (3/4) ... [2025-03-04 00:25:47,598 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:25:47,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:25:47,599 INFO L158 Benchmark]: Toolchain (without parser) took 3904.42ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.8MB in the beginning and 152.4MB in the end (delta: -46.5MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2025-03-04 00:25:47,599 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:25:47,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.62ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.8MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:25:47,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.90ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:25:47,599 INFO L158 Benchmark]: Boogie Preprocessor took 30.09ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:25:47,599 INFO L158 Benchmark]: IcfgBuilder took 309.73ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 69.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:25:47,599 INFO L158 Benchmark]: TraceAbstraction took 3308.65ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 67.7MB in the beginning and 152.5MB in the end (delta: -84.8MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2025-03-04 00:25:47,599 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 318.8MB. Free memory was 152.5MB in the beginning and 152.4MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:25:47,600 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.62ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.8MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.90ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.09ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 87.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 309.73ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 69.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3308.65ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 67.7MB in the beginning and 152.5MB in the end (delta: -84.8MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 318.8MB. Free memory was 152.5MB in the beginning and 152.4MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 8; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] float var_1_8 = 1.8; [L30] float var_1_9 = 9999999999999.75; [L31] float var_1_10 = 8.75; [L32] float var_1_11 = 255.75; [L33] unsigned short int var_1_12 = 10; [L34] unsigned char var_1_13 = 2; [L35] unsigned short int var_1_14 = 4; VAL [isInitial=0, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=0, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L85] var_1_9 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L86] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L87] var_1_10 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L88] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L89] var_1_11 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L90] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L103] RET updateVariables() [L104] CALL step() [L39] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L53] var_1_12 = 100 [L54] var_1_13 = var_1_3 [L55] var_1_14 = var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] COND TRUE (var_1_13 >> var_1_3) <= var_1_5 [L57] COND TRUE (25 > var_1_13) && var_1_7 [L58] var_1_8 = (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1] [L95] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1] [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1] [L95-L96] return ((((var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9)))) && (var_1_12 == ((unsigned short int) 100))) && (var_1_13 == ((unsigned char) var_1_3))) && (var_1_14 == ((unsigned short int) var_1_3)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1] [L19] reach_error() VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=50, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=49, var_1_6=-255, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 1504 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1010 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 494 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 1480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2912/2940 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:25:47,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7769f6e88057884e9f756ce4db3366a3e684d2e94a6b3544a7e6cd1c830e602 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:25:49,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:25:49,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:25:49,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:25:49,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:25:49,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:25:49,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:25:49,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:25:49,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:25:49,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:25:49,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:25:49,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:25:49,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:25:49,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:25:49,486 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:25:49,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:25:49,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:25:49,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:25:49,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:25:49,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:25:49,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:25:49,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:25:49,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:25:49,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:25:49,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:25:49,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:25:49,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7769f6e88057884e9f756ce4db3366a3e684d2e94a6b3544a7e6cd1c830e602 [2025-03-04 00:25:49,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:25:49,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:25:49,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:25:49,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:25:49,877 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:25:49,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i [2025-03-04 00:25:51,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2eaad53/d717fa6c778244db9fb5cd0246e3d5f3/FLAG85490e726 [2025-03-04 00:25:51,236 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:25:51,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i [2025-03-04 00:25:51,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2eaad53/d717fa6c778244db9fb5cd0246e3d5f3/FLAG85490e726 [2025-03-04 00:25:51,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2eaad53/d717fa6c778244db9fb5cd0246e3d5f3 [2025-03-04 00:25:51,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:25:51,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:25:51,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:25:51,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:25:51,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:25:51,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e45b51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51, skipping insertion in model container [2025-03-04 00:25:51,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:25:51,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i[915,928] [2025-03-04 00:25:51,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:25:51,774 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:25:51,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-71.i[915,928] [2025-03-04 00:25:51,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:25:51,809 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:25:51,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51 WrapperNode [2025-03-04 00:25:51,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:25:51,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:25:51,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:25:51,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:25:51,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,836 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-03-04 00:25:51,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:25:51,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:25:51,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:25:51,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:25:51,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,863 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:25:51,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:25:51,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:25:51,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:25:51,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:25:51,888 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (1/1) ... [2025-03-04 00:25:51,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:25:51,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:25:51,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:25:51,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:25:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:25:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:25:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:25:51,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:25:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:25:51,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:25:51,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:25:52,000 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:25:52,277 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:25:52,277 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:25:52,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:25:52,286 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:25:52,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:25:52 BoogieIcfgContainer [2025-03-04 00:25:52,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:25:52,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:25:52,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:25:52,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:25:52,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:25:51" (1/3) ... [2025-03-04 00:25:52,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279d72ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:25:52, skipping insertion in model container [2025-03-04 00:25:52,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:51" (2/3) ... [2025-03-04 00:25:52,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279d72ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:25:52, skipping insertion in model container [2025-03-04 00:25:52,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:25:52" (3/3) ... [2025-03-04 00:25:52,293 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-71.i [2025-03-04 00:25:52,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:25:52,305 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-71.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:25:52,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:25:52,348 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;@6cbc3519, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:25:52,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:25:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:25:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:25:52,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:52,358 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:52,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1738624977, now seen corresponding path program 1 times [2025-03-04 00:25:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:25:52,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855443768] [2025-03-04 00:25:52,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:52,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:25:52,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:25:52,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:25:52,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:25:52,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:25:52,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:25:52,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:52,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:52,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:25:52,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:25:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-04 00:25:52,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:25:52,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:25:52,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855443768] [2025-03-04 00:25:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855443768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:25:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:25:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:25:52,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137264945] [2025-03-04 00:25:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:25:52,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:25:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:25:52,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:25:52,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:25:52,564 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:25:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:52,582 INFO L93 Difference]: Finished difference Result 90 states and 148 transitions. [2025-03-04 00:25:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:25:52,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2025-03-04 00:25:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:52,587 INFO L225 Difference]: With dead ends: 90 [2025-03-04 00:25:52,587 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 00:25:52,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:25:52,591 INFO L435 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:25:52,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:25:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 00:25:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 00:25:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:25:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-03-04 00:25:52,638 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 96 [2025-03-04 00:25:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:52,638 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-03-04 00:25:52,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:25:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-03-04 00:25:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 00:25:52,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:52,643 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:25:52,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:25:52,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:25:52,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:52,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:52,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1251635756, now seen corresponding path program 1 times [2025-03-04 00:25:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:25:52,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083781569] [2025-03-04 00:25:52,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:25:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:25:52,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:25:52,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:25:52,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 00:25:52,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 00:25:52,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:52,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:52,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:25:52,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:25:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-04 00:25:53,840 INFO L312 TraceCheckSpWp]: Computing backward predicates...