./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_fillercode_fillercodestructure_normal_file-3.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:30:16,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:30:16,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:30:16,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:30:16,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:30:16,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:30:16,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:30:16,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:30:16,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:30:16,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:30:16,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:30:16,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:30:16,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:30:16,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:30:16,829 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:30:16,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:30:16,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:30:16,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:30:16,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:30:16,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:30:16,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:30:16,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:30:16,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:30:16,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:30:16,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:30:16,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:30:16,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:30:16,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:30:16,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:30:16,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:30:16,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:30:16,833 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2025-03-17 02:30:17,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:30:17,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:30:17,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:30:17,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:30:17,085 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:30:17,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2025-03-17 02:30:18,309 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea2fb4c1/c3ed8b0b23384449bf4e9708a38c4607/FLAGebfe5ce69 [2025-03-17 02:30:18,570 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:30:18,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2025-03-17 02:30:18,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea2fb4c1/c3ed8b0b23384449bf4e9708a38c4607/FLAGebfe5ce69 [2025-03-17 02:30:18,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea2fb4c1/c3ed8b0b23384449bf4e9708a38c4607 [2025-03-17 02:30:18,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:30:18,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:30:18,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:30:18,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:30:18,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:30:18,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10299ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18, skipping insertion in model container [2025-03-17 02:30:18,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:30:18,723 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_fillercode_fillercodestructure_normal_file-3.i[912,925] [2025-03-17 02:30:18,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:30:18,793 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:30:18,802 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_fillercode_fillercodestructure_normal_file-3.i[912,925] [2025-03-17 02:30:18,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:30:18,848 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:30:18,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18 WrapperNode [2025-03-17 02:30:18,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:30:18,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:30:18,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:30:18,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:30:18,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,883 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-17 02:30:18,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:30:18,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:30:18,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:30:18,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:30:18,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,908 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-17 02:30:18,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:30:18,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:30:18,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:30:18,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:30:18,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (1/1) ... [2025-03-17 02:30:18,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:30:18,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:18,959 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-17 02:30:18,962 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-17 02:30:18,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:30:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:30:18,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:30:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:30:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:30:18,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:30:19,038 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:30:19,039 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:30:19,280 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-03-17 02:30:19,303 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 02:30:19,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:30:19,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:30:19,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:30:19,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:19 BoogieIcfgContainer [2025-03-17 02:30:19,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:30:19,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:30:19,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:30:19,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:30:19,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:30:18" (1/3) ... [2025-03-17 02:30:19,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6e830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:19, skipping insertion in model container [2025-03-17 02:30:19,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:18" (2/3) ... [2025-03-17 02:30:19,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6e830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:19, skipping insertion in model container [2025-03-17 02:30:19,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:19" (3/3) ... [2025-03-17 02:30:19,326 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-3.i [2025-03-17 02:30:19,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:30:19,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-3.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:30:19,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:30:19,383 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;@4097b0d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:30:19,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:30:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 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-17 02:30:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 02:30:19,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:19,393 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-17 02:30:19,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:19,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:19,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1748075966, now seen corresponding path program 1 times [2025-03-17 02:30:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:19,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716290008] [2025-03-17 02:30:19,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:19,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 02:30:19,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 02:30:19,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:19,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:19,596 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-17 02:30:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716290008] [2025-03-17 02:30:19,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716290008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:30:19,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004262168] [2025-03-17 02:30:19,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:19,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:30:19,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:19,603 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-17 02:30:19,604 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-17 02:30:19,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 02:30:19,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 02:30:19,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:19,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:19,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:30:19,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:30:19,771 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-17 02:30:19,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:30:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004262168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:19,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:30:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:30:19,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750520556] [2025-03-17 02:30:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:19,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:30:19,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:19,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:30:19,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:30:19,796 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-17 02:30:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:19,823 INFO L93 Difference]: Finished difference Result 129 states and 221 transitions. [2025-03-17 02:30:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:30:19,824 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 102 [2025-03-17 02:30:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:19,828 INFO L225 Difference]: With dead ends: 129 [2025-03-17 02:30:19,828 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 02:30:19,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-17 02:30:19,833 INFO L435 NwaCegarLoop]: 97 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, 97 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-17 02:30:19,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:30:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 02:30:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 02:30:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 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-17 02:30:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2025-03-17 02:30:19,866 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 102 [2025-03-17 02:30:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:19,867 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2025-03-17 02:30:19,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-17 02:30:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2025-03-17 02:30:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 02:30:19,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:19,869 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-17 02:30:19,876 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-17 02:30:20,073 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-17 02:30:20,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:20,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash -730091233, now seen corresponding path program 1 times [2025-03-17 02:30:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:20,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082436389] [2025-03-17 02:30:20,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:20,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:20,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 02:30:20,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 02:30:20,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:20,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:20,406 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-17 02:30:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082436389] [2025-03-17 02:30:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082436389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:30:20,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114428467] [2025-03-17 02:30:20,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:30:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:20,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:30:20,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:30:20,413 INFO L87 Difference]: Start difference. First operand 64 states and 99 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-17 02:30:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:20,484 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-03-17 02:30:20,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:30:20,485 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-17 02:30:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:20,488 INFO L225 Difference]: With dead ends: 190 [2025-03-17 02:30:20,488 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 02:30:20,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 02:30:20,489 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 61 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:20,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 193 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:30:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 02:30:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-03-17 02:30:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:30:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2025-03-17 02:30:20,508 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 102 [2025-03-17 02:30:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:20,509 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2025-03-17 02:30:20,509 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-17 02:30:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2025-03-17 02:30:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 02:30:20,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:20,511 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, 1] [2025-03-17 02:30:20,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:30:20,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:20,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash -671026327, now seen corresponding path program 1 times [2025-03-17 02:30:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:20,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092958143] [2025-03-17 02:30:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:20,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 02:30:20,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 02:30:20,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:20,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:20,629 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-17 02:30:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092958143] [2025-03-17 02:30:20,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092958143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:20,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:20,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:30:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014971956] [2025-03-17 02:30:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:20,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:30:20,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:20,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:30:20,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:30:20,633 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-17 02:30:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:20,698 INFO L93 Difference]: Finished difference Result 311 states and 476 transitions. [2025-03-17 02:30:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:30:20,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 103 [2025-03-17 02:30:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:20,703 INFO L225 Difference]: With dead ends: 311 [2025-03-17 02:30:20,703 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 02:30:20,704 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-17 02:30:20,707 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 40 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:20,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 210 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:30:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 02:30:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 143. [2025-03-17 02:30:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 110 states have (on average 1.4363636363636363) internal successors, (158), 110 states have internal predecessors, (158), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:30:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2025-03-17 02:30:20,724 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 103 [2025-03-17 02:30:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:20,724 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2025-03-17 02:30:20,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-17 02:30:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2025-03-17 02:30:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 02:30:20,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:20,726 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, 1] [2025-03-17 02:30:20,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:30:20,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:20,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:20,726 INFO L85 PathProgramCache]: Analyzing trace with hash -816790934, now seen corresponding path program 1 times [2025-03-17 02:30:20,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:20,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274145303] [2025-03-17 02:30:20,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:20,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:20,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 02:30:20,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 02:30:20,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:20,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:20,851 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-17 02:30:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:20,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274145303] [2025-03-17 02:30:20,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274145303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:20,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:30:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133323908] [2025-03-17 02:30:20,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:20,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:30:20,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:20,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:30:20,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:30:20,855 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-17 02:30:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:20,934 INFO L93 Difference]: Finished difference Result 419 states and 642 transitions. [2025-03-17 02:30:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:30:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 103 [2025-03-17 02:30:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:20,937 INFO L225 Difference]: With dead ends: 419 [2025-03-17 02:30:20,937 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 02:30:20,937 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-17 02:30:20,938 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 85 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:20,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:30:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 02:30:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2025-03-17 02:30:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 210 states have (on average 1.4190476190476191) internal successors, (298), 210 states have internal predecessors, (298), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 02:30:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 418 transitions. [2025-03-17 02:30:20,970 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 418 transitions. Word has length 103 [2025-03-17 02:30:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:20,970 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 418 transitions. [2025-03-17 02:30:20,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-17 02:30:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 418 transitions. [2025-03-17 02:30:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:30:20,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:20,971 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, 1, 1] [2025-03-17 02:30:20,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:30:20,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:20,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash 509675042, now seen corresponding path program 1 times [2025-03-17 02:30:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788334899] [2025-03-17 02:30:20,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:20,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:30:21,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:30:21,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:21,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:21,238 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-17 02:30:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788334899] [2025-03-17 02:30:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788334899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:21,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:21,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:30:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064900528] [2025-03-17 02:30:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:21,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:30:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:21,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:30:21,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:30:21,242 INFO L87 Difference]: Start difference. First operand 275 states and 418 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-17 02:30:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:21,492 INFO L93 Difference]: Finished difference Result 691 states and 1052 transitions. [2025-03-17 02:30:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:30:21,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 104 [2025-03-17 02:30:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:21,502 INFO L225 Difference]: With dead ends: 691 [2025-03-17 02:30:21,503 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 02:30:21,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:30:21,504 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:21,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 294 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:30:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 02:30:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 545. [2025-03-17 02:30:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 416 states have (on average 1.4230769230769231) internal successors, (592), 416 states have internal predecessors, (592), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-17 02:30:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 832 transitions. [2025-03-17 02:30:21,556 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 832 transitions. Word has length 104 [2025-03-17 02:30:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:21,557 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 832 transitions. [2025-03-17 02:30:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-17 02:30:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 832 transitions. [2025-03-17 02:30:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:30:21,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:21,558 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, 1, 1] [2025-03-17 02:30:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:30:21,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash -367142621, now seen corresponding path program 1 times [2025-03-17 02:30:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:21,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615131009] [2025-03-17 02:30:21,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:21,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:30:21,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:30:21,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:21,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 02:30:22,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:22,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615131009] [2025-03-17 02:30:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615131009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:22,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:22,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:30:22,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799842744] [2025-03-17 02:30:22,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:22,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:30:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:22,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:30:22,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:30:22,859 INFO L87 Difference]: Start difference. First operand 545 states and 832 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:30:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:23,415 INFO L93 Difference]: Finished difference Result 1669 states and 2455 transitions. [2025-03-17 02:30:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 02:30:23,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2025-03-17 02:30:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:23,423 INFO L225 Difference]: With dead ends: 1669 [2025-03-17 02:30:23,424 INFO L226 Difference]: Without dead ends: 1125 [2025-03-17 02:30:23,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:30:23,426 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 256 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:23,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 298 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:30:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-17 02:30:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 685. [2025-03-17 02:30:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 548 states have (on average 1.4343065693430657) internal successors, (786), 548 states have internal predecessors, (786), 120 states have call successors, (120), 16 states have call predecessors, (120), 16 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-17 02:30:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1026 transitions. [2025-03-17 02:30:23,507 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1026 transitions. Word has length 104 [2025-03-17 02:30:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:23,507 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1026 transitions. [2025-03-17 02:30:23,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:30:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1026 transitions. [2025-03-17 02:30:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:30:23,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:23,510 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, 1, 1] [2025-03-17 02:30:23,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:30:23,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:23,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:23,511 INFO L85 PathProgramCache]: Analyzing trace with hash 986167076, now seen corresponding path program 1 times [2025-03-17 02:30:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346486725] [2025-03-17 02:30:23,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:23,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:30:23,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:30:23,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:23,617 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-17 02:30:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346486725] [2025-03-17 02:30:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346486725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:30:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827379400] [2025-03-17 02:30:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:30:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:23,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:30:23,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:30:23,620 INFO L87 Difference]: Start difference. First operand 685 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-17 02:30:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:23,743 INFO L93 Difference]: Finished difference Result 1667 states and 2496 transitions. [2025-03-17 02:30:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:30:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 104 [2025-03-17 02:30:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:23,750 INFO L225 Difference]: With dead ends: 1667 [2025-03-17 02:30:23,751 INFO L226 Difference]: Without dead ends: 983 [2025-03-17 02:30:23,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 02:30:23,753 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:23,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 203 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:30:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-03-17 02:30:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2025-03-17 02:30:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 776 states have (on average 1.4201030927835052) internal successors, (1102), 776 states have internal predecessors, (1102), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-17 02:30:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1462 transitions. [2025-03-17 02:30:23,827 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1462 transitions. Word has length 104 [2025-03-17 02:30:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:23,827 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1462 transitions. [2025-03-17 02:30:23,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-17 02:30:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1462 transitions. [2025-03-17 02:30:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 02:30:23,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:23,829 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, 1, 1, 1] [2025-03-17 02:30:23,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:30:23,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:23,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1925817052, now seen corresponding path program 1 times [2025-03-17 02:30:23,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:23,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74624775] [2025-03-17 02:30:23,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:23,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 02:30:23,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 02:30:23,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:23,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:23,996 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-17 02:30:23,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:23,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74624775] [2025-03-17 02:30:23,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74624775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:23,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:23,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:30:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264464717] [2025-03-17 02:30:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:23,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:30:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:23,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:30:23,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:30:23,998 INFO L87 Difference]: Start difference. First operand 981 states and 1462 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:30:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:24,410 INFO L93 Difference]: Finished difference Result 1846 states and 2751 transitions. [2025-03-17 02:30:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:30:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2025-03-17 02:30:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:24,417 INFO L225 Difference]: With dead ends: 1846 [2025-03-17 02:30:24,417 INFO L226 Difference]: Without dead ends: 1599 [2025-03-17 02:30:24,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:30:24,419 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 268 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:24,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 371 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:30:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-03-17 02:30:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1451. [2025-03-17 02:30:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1144 states have (on average 1.4187062937062938) internal successors, (1623), 1144 states have internal predecessors, (1623), 270 states have call successors, (270), 36 states have call predecessors, (270), 36 states have return successors, (270), 270 states have call predecessors, (270), 270 states have call successors, (270) [2025-03-17 02:30:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2163 transitions. [2025-03-17 02:30:24,530 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2163 transitions. Word has length 105 [2025-03-17 02:30:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:24,531 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 2163 transitions. [2025-03-17 02:30:24,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:30:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2163 transitions. [2025-03-17 02:30:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 02:30:24,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:24,533 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, 1, 1, 1] [2025-03-17 02:30:24,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:30:24,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2098596971, now seen corresponding path program 1 times [2025-03-17 02:30:24,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487691886] [2025-03-17 02:30:24,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:24,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 02:30:24,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 02:30:24,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:24,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:24,684 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-17 02:30:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487691886] [2025-03-17 02:30:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487691886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:30:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539925441] [2025-03-17 02:30:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:24,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:30:24,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:24,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:30:24,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:30:24,686 INFO L87 Difference]: Start difference. First operand 1451 states and 2163 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-17 02:30:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:24,974 INFO L93 Difference]: Finished difference Result 2550 states and 3802 transitions. [2025-03-17 02:30:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:30:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 105 [2025-03-17 02:30:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:24,985 INFO L225 Difference]: With dead ends: 2550 [2025-03-17 02:30:24,985 INFO L226 Difference]: Without dead ends: 1817 [2025-03-17 02:30:24,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:30:24,989 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 175 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:24,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 360 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:30:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-03-17 02:30:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1571. [2025-03-17 02:30:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1264 states have (on average 1.4295886075949367) internal successors, (1807), 1264 states have internal predecessors, (1807), 270 states have call successors, (270), 36 states have call predecessors, (270), 36 states have return successors, (270), 270 states have call predecessors, (270), 270 states have call successors, (270) [2025-03-17 02:30:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2347 transitions. [2025-03-17 02:30:25,189 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2347 transitions. Word has length 105 [2025-03-17 02:30:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2347 transitions. [2025-03-17 02:30:25,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-17 02:30:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2347 transitions. [2025-03-17 02:30:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 02:30:25,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:25,191 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, 1, 1, 1] [2025-03-17 02:30:25,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:30:25,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:25,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1303898509, now seen corresponding path program 1 times [2025-03-17 02:30:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:25,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629223124] [2025-03-17 02:30:25,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:25,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:25,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 02:30:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 02:30:25,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:25,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 02:30:25,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:25,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629223124] [2025-03-17 02:30:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629223124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:30:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015519157] [2025-03-17 02:30:25,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:25,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:30:25,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:25,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:30:25,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:30:25,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 02:30:25,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 02:30:25,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:25,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:25,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 02:30:25,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:30:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 310 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-17 02:30:26,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:30:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-17 02:30:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015519157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:30:27,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:30:27,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2025-03-17 02:30:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965187036] [2025-03-17 02:30:27,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:30:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 02:30:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:27,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 02:30:27,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 02:30:27,409 INFO L87 Difference]: Start difference. First operand 1571 states and 2347 transitions. Second operand has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2025-03-17 02:30:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:28,677 INFO L93 Difference]: Finished difference Result 3037 states and 4341 transitions. [2025-03-17 02:30:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 02:30:28,678 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) Word has length 105 [2025-03-17 02:30:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:28,685 INFO L225 Difference]: With dead ends: 3037 [2025-03-17 02:30:28,686 INFO L226 Difference]: Without dead ends: 1873 [2025-03-17 02:30:28,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1097, Invalid=2563, Unknown=0, NotChecked=0, Total=3660 [2025-03-17 02:30:28,690 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 675 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:28,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 458 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:30:28,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-03-17 02:30:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1317. [2025-03-17 02:30:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1036 states have (on average 1.3532818532818534) internal successors, (1402), 1036 states have internal predecessors, (1402), 210 states have call successors, (210), 70 states have call predecessors, (210), 70 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 02:30:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1822 transitions. [2025-03-17 02:30:28,818 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1822 transitions. Word has length 105 [2025-03-17 02:30:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:28,818 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1822 transitions. [2025-03-17 02:30:28,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2025-03-17 02:30:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1822 transitions. [2025-03-17 02:30:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 02:30:28,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:28,822 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, 1, 1, 1] [2025-03-17 02:30:28,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:30:29,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 02:30:29,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:29,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1542958219, now seen corresponding path program 1 times [2025-03-17 02:30:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:29,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733020867] [2025-03-17 02:30:29,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:29,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 02:30:29,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 02:30:29,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:29,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:29,256 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-17 02:30:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733020867] [2025-03-17 02:30:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733020867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:29,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:30:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803346066] [2025-03-17 02:30:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:29,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:30:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:29,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:30:29,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:30:29,257 INFO L87 Difference]: Start difference. First operand 1317 states and 1822 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:30:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:29,677 INFO L93 Difference]: Finished difference Result 2651 states and 3662 transitions. [2025-03-17 02:30:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 02:30:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2025-03-17 02:30:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:29,683 INFO L225 Difference]: With dead ends: 2651 [2025-03-17 02:30:29,684 INFO L226 Difference]: Without dead ends: 1335 [2025-03-17 02:30:29,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:30:29,687 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 293 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:29,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 431 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:30:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-03-17 02:30:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1321. [2025-03-17 02:30:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1040 states have (on average 1.35) internal successors, (1404), 1040 states have internal predecessors, (1404), 210 states have call successors, (210), 70 states have call predecessors, (210), 70 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 02:30:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1824 transitions. [2025-03-17 02:30:29,835 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1824 transitions. Word has length 105 [2025-03-17 02:30:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:29,835 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1824 transitions. [2025-03-17 02:30:29,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:30:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1824 transitions. [2025-03-17 02:30:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 02:30:29,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:29,837 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, 1, 1, 1, 1] [2025-03-17 02:30:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:30:29,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:29,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1085507461, now seen corresponding path program 1 times [2025-03-17 02:30:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376974938] [2025-03-17 02:30:29,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:29,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:30:29,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:30:29,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:29,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:30,048 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-17 02:30:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:30:30,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376974938] [2025-03-17 02:30:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376974938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:30,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:30:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41637250] [2025-03-17 02:30:30,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:30,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:30:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:30:30,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:30:30,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:30:30,049 INFO L87 Difference]: Start difference. First operand 1321 states and 1824 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:30:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:31,108 INFO L93 Difference]: Finished difference Result 2381 states and 3286 transitions. [2025-03-17 02:30:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:30:31,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2025-03-17 02:30:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:31,117 INFO L225 Difference]: With dead ends: 2381 [2025-03-17 02:30:31,117 INFO L226 Difference]: Without dead ends: 1659 [2025-03-17 02:30:31,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:30:31,120 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 337 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:30:31,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1030 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 02:30:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-17 02:30:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1421. [2025-03-17 02:30:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1120 states have (on average 1.3508928571428571) internal successors, (1513), 1120 states have internal predecessors, (1513), 225 states have call successors, (225), 75 states have call predecessors, (225), 75 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-17 02:30:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1963 transitions. [2025-03-17 02:30:31,232 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1963 transitions. Word has length 106 [2025-03-17 02:30:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:31,232 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 1963 transitions. [2025-03-17 02:30:31,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:30:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1963 transitions. [2025-03-17 02:30:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 02:30:31,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:31,233 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, 1, 1, 1, 1] [2025-03-17 02:30:31,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:30:31,234 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:31,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1805625697, now seen corresponding path program 1 times [2025-03-17 02:30:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:30:31,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420913934] [2025-03-17 02:30:31,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:30:31,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:30:31,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:30:31,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:31,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:30:31,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665358171] [2025-03-17 02:30:31,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:31,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:30:31,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:31,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:30:31,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 02:30:31,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:30:31,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:30:31,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:31,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:30:31,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:30:31,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:30:31,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:30:31,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:31,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:30:31,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:30:31,461 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:30:31,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:30:31,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 02:30:31,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:30:31,668 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:30:31,742 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:30:31,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:30:31 BoogieIcfgContainer [2025-03-17 02:30:31,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:30:31,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:30:31,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:30:31,744 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:30:31,745 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:19" (3/4) ... [2025-03-17 02:30:31,746 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:30:31,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:30:31,747 INFO L158 Benchmark]: Toolchain (without parser) took 13150.26ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 112.0MB in the beginning and 233.8MB in the end (delta: -121.8MB). Peak memory consumption was 293.4MB. Max. memory is 16.1GB. [2025-03-17 02:30:31,747 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:30:31,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.64ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:30:31,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.53ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:30:31,747 INFO L158 Benchmark]: Boogie Preprocessor took 43.56ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 90.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:30:31,748 INFO L158 Benchmark]: IcfgBuilder took 391.03ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 67.3MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:30:31,748 INFO L158 Benchmark]: TraceAbstraction took 12423.31ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 66.4MB in the beginning and 233.8MB in the end (delta: -167.4MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. [2025-03-17 02:30:31,748 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 562.0MB. Free memory is still 233.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:30:31,749 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.44ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.64ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.53ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.56ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 90.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 391.03ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 67.3MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12423.31ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 66.4MB in the beginning and 233.8MB in the end (delta: -167.4MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 562.0MB. Free memory is still 233.8MB. 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 bitwiseOr at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L125] RET updateVariables() [L126] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-16129, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L51] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L52] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L57] COND FALSE !(stepLocal_1 || var_1_3) [L62] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L64] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 119 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2387 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2369 mSDsluCounter, 4193 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2769 mSDsCounter, 641 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2534 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 641 mSolverCounterUnsat, 1424 mSDtfsCounter, 2534 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1571occurred in iteration=9, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 1700 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1667 NumberOfCodeBlocks, 1667 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1545 ConstructedInterpolants, 0 QuantifiedInterpolants, 6215 SizeOfPredicates, 6 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 6191/6300 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-17 02:30:31,778 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_fillercode_fillercodestructure_normal_file-3.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:30:33,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:30:33,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:30:33,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:30:33,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:30:33,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:30:33,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:30:33,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:30:33,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:30:33,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:30:33,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:30:33,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:30:33,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:30:33,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:30:33,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:30:33,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:30:33,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:30:33,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:30:33,908 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:30:33,908 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:30:33,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:30:33,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:30:33,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:30:33,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:30:33,908 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2025-03-17 02:30:34,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:30:34,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:30:34,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:30:34,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:30:34,206 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:30:34,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2025-03-17 02:30:35,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c8d3cac/921fdfff4f704ee98e386c6efb04155d/FLAG286da1738 [2025-03-17 02:30:35,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:30:35,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2025-03-17 02:30:35,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c8d3cac/921fdfff4f704ee98e386c6efb04155d/FLAG286da1738 [2025-03-17 02:30:35,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c8d3cac/921fdfff4f704ee98e386c6efb04155d [2025-03-17 02:30:35,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:30:35,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:30:35,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:30:35,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:30:35,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:30:35,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:35,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e31555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35, skipping insertion in model container [2025-03-17 02:30:35,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:35,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:30:35,816 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_fillercode_fillercodestructure_normal_file-3.i[912,925] [2025-03-17 02:30:35,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:30:35,892 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:30:35,900 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_fillercode_fillercodestructure_normal_file-3.i[912,925] [2025-03-17 02:30:35,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:30:35,948 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:30:35,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35 WrapperNode [2025-03-17 02:30:35,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:30:35,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:30:35,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:30:35,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:30:35,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:35,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:35,990 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-17 02:30:35,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:30:35,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:30:35,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:30:35,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:30:35,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:35,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,014 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-17 02:30:36,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:30:36,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:30:36,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:30:36,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:30:36,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (1/1) ... [2025-03-17 02:30:36,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:30:36,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:30:36,069 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-17 02:30:36,072 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-17 02:30:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:30:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:30:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:30:36,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:30:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:30:36,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:30:36,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:30:36,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:30:50,614 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:30:50,617 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:30:50,624 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:30:50,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:30:50,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:50 BoogieIcfgContainer [2025-03-17 02:30:50,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:30:50,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:30:50,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:30:50,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:30:50,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:30:35" (1/3) ... [2025-03-17 02:30:50,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebe8cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:50, skipping insertion in model container [2025-03-17 02:30:50,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:35" (2/3) ... [2025-03-17 02:30:50,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebe8cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:50, skipping insertion in model container [2025-03-17 02:30:50,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:50" (3/3) ... [2025-03-17 02:30:50,633 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-3.i [2025-03-17 02:30:50,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:30:50,644 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-3.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:30:50,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:30:50,697 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;@5144b01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:30:50,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:30:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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-17 02:30:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 02:30:50,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:50,709 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] [2025-03-17 02:30:50,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:50,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash -452792730, now seen corresponding path program 1 times [2025-03-17 02:30:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:30:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929841946] [2025-03-17 02:30:50,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:50,726 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-17 02:30:50,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:30:50,728 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-17 02:30:50,730 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-17 02:30:50,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 02:30:51,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 02:30:51,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:51,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:51,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:30:51,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:30:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-17 02:30:51,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:30:51,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:30:51,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929841946] [2025-03-17 02:30:51,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929841946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:51,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:51,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:30:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945785414] [2025-03-17 02:30:51,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:51,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:30:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:30:51,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:30:51,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:30:51,730 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-17 02:30:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:30:51,749 INFO L93 Difference]: Finished difference Result 105 states and 183 transitions. [2025-03-17 02:30:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:30:51,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 98 [2025-03-17 02:30:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:30:51,757 INFO L225 Difference]: With dead ends: 105 [2025-03-17 02:30:51,758 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 02:30:51,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-17 02:30:51,762 INFO L435 NwaCegarLoop]: 80 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, 80 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-17 02:30:51,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:30:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 02:30:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 02:30:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 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-17 02:30:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2025-03-17 02:30:51,791 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 98 [2025-03-17 02:30:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:30:51,791 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2025-03-17 02:30:51,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-17 02:30:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2025-03-17 02:30:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 02:30:51,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:30:51,798 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] [2025-03-17 02:30:51,824 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-17 02:30:51,998 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-17 02:30:51,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:30:51,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:30:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash 321122887, now seen corresponding path program 1 times [2025-03-17 02:30:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:30:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780480610] [2025-03-17 02:30:52,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:30:52,000 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-17 02:30:52,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:30:52,002 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-17 02:30:52,002 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-17 02:30:52,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 02:30:52,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 02:30:52,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:30:52,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:30:52,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 02:30:52,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:30:55,524 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-17 02:30:55,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:30:55,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:30:55,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780480610] [2025-03-17 02:30:55,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780480610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:30:55,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:30:55,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:30:55,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886047565] [2025-03-17 02:30:55,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:30:55,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:30:55,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:30:55,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:30:55,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:30:55,528 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-17 02:30:59,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:03,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:07,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:12,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:15,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:21,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:25,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:29,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:33,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:37,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:31:37,495 INFO L93 Difference]: Finished difference Result 154 states and 238 transitions. [2025-03-17 02:31:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:31:37,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 98 [2025-03-17 02:31:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:31:37,603 INFO L225 Difference]: With dead ends: 154 [2025-03-17 02:31:37,603 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 02:31:37,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:31:37,604 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 29 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:31:37,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 41.9s Time] [2025-03-17 02:31:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 02:31:37,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-03-17 02:31:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:31:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2025-03-17 02:31:37,616 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 98 [2025-03-17 02:31:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:31:37,617 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2025-03-17 02:31:37,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-17 02:31:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2025-03-17 02:31:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 02:31:37,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:31:37,620 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-17 02:31:37,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 02:31:37,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:31:37,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:31:37,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:31:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1090476357, now seen corresponding path program 1 times [2025-03-17 02:31:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:31:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355768479] [2025-03-17 02:31:37,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:31:37,822 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-17 02:31:37,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:31:37,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:31:37,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 02:31:37,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 02:31:38,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 02:31:38,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:31:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:31:38,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 02:31:38,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:31:38,922 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-17 02:31:38,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:31:38,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:31:38,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355768479] [2025-03-17 02:31:38,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355768479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:31:38,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:31:38,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:31:38,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551764325] [2025-03-17 02:31:38,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:31:38,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:31:38,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:31:38,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:31:38,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:31:38,925 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 02:31:43,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:47,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:31:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:31:47,631 INFO L93 Difference]: Finished difference Result 239 states and 366 transitions. [2025-03-17 02:31:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:31:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 02:31:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:31:47,648 INFO L225 Difference]: With dead ends: 239 [2025-03-17 02:31:47,648 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 02:31:47,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:31:47,650 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 26 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:31:47,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 139 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-03-17 02:31:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 02:31:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2025-03-17 02:31:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:31:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2025-03-17 02:31:47,663 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 99 [2025-03-17 02:31:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:31:47,664 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2025-03-17 02:31:47,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-17 02:31:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2025-03-17 02:31:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 02:31:47,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:31:47,666 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-17 02:31:47,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 02:31:47,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-17 02:31:47,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:31:47,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:31:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1043050456, now seen corresponding path program 1 times [2025-03-17 02:31:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:31:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117487415] [2025-03-17 02:31:47,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:31:47,867 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-17 02:31:47,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:31:47,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:31:47,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 02:31:47,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 02:31:48,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 02:31:48,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:31:48,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:31:48,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 02:31:48,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:31:51,863 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-17 02:31:51,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:31:51,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:31:51,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117487415] [2025-03-17 02:31:51,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117487415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:31:51,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:31:51,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:31:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824606695] [2025-03-17 02:31:51,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:31:51,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:31:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:31:51,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:31:51,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:31:51,864 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.6) 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)