./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.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 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:41:34,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:41:34,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:41:34,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:41:34,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:41:34,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:41:34,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:41:34,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:41:34,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:41:34,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:41:34,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:41:34,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:41:34,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:41:34,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:41:34,984 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:41:34,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:41:34,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:41:34,984 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:41:34,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:41:34,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:41:34,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:41:34,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:41:34,986 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 -> 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 [2025-03-03 22:41:35,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:41:35,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:41:35,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:41:35,212 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:41:35,212 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:41:35,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2025-03-03 22:41:36,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da4b8d84/648439932e9a467bb9d781706333de9f/FLAG0dde730ae [2025-03-03 22:41:36,622 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:41:36,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2025-03-03 22:41:36,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da4b8d84/648439932e9a467bb9d781706333de9f/FLAG0dde730ae [2025-03-03 22:41:36,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da4b8d84/648439932e9a467bb9d781706333de9f [2025-03-03 22:41:36,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:41:36,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:41:36,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:41:36,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:41:36,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:41:36,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c06ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36, skipping insertion in model container [2025-03-03 22:41:36,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:41:36,769 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2025-03-03 22:41:36,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:41:36,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:41:36,828 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2025-03-03 22:41:36,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:41:36,852 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:41:36,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36 WrapperNode [2025-03-03 22:41:36,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:41:36,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:41:36,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:41:36,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:41:36,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,878 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-03 22:41:36,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:41:36,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:41:36,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:41:36,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:41:36,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,896 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-03 22:41:36,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:41:36,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:41:36,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:41:36,906 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:41:36,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (1/1) ... [2025-03-03 22:41:36,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:41:36,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:36,932 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-03 22:41:36,939 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-03 22:41:36,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:41:36,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:41:36,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:41:36,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:41:36,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:41:36,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:41:37,005 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:41:37,007 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:41:37,216 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-03 22:41:37,252 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 22:41:37,253 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:41:37,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:41:37,265 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:41:37,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:37 BoogieIcfgContainer [2025-03-03 22:41:37,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:41:37,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:41:37,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:41:37,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:41:37,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:41:36" (1/3) ... [2025-03-03 22:41:37,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5030e05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:37, skipping insertion in model container [2025-03-03 22:41:37,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36" (2/3) ... [2025-03-03 22:41:37,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5030e05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:37, skipping insertion in model container [2025-03-03 22:41:37,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:37" (3/3) ... [2025-03-03 22:41:37,274 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-97.i [2025-03-03 22:41:37,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:41:37,291 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-97.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:41:37,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:41:37,345 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;@461e01a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:41:37,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:41:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:41:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 22:41:37,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:37,360 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:37,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:37,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash 321972114, now seen corresponding path program 1 times [2025-03-03 22:41:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:37,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566042275] [2025-03-03 22:41:37,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:37,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 22:41:37,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 22:41:37,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:37,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566042275] [2025-03-03 22:41:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566042275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:38,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:38,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:41:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951528264] [2025-03-03 22:41:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:38,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:41:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:38,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:41:38,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:41:38,114 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:38,236 INFO L93 Difference]: Finished difference Result 169 states and 296 transitions. [2025-03-03 22:41:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:41:38,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2025-03-03 22:41:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:38,244 INFO L225 Difference]: With dead ends: 169 [2025-03-03 22:41:38,244 INFO L226 Difference]: Without dead ends: 109 [2025-03-03 22:41:38,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:41:38,250 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 67 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:38,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 489 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:41:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-03 22:41:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2025-03-03 22:41:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:41:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2025-03-03 22:41:38,292 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 113 [2025-03-03 22:41:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:38,293 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2025-03-03 22:41:38,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2025-03-03 22:41:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 22:41:38,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:38,298 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:38,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 22:41:38,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:38,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1944262911, now seen corresponding path program 1 times [2025-03-03 22:41:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:38,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87944522] [2025-03-03 22:41:38,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:38,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 22:41:38,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 22:41:38,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:38,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:38,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:38,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87944522] [2025-03-03 22:41:38,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87944522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:38,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:38,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:41:38,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038700609] [2025-03-03 22:41:38,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:38,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:41:38,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:38,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:41:38,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:41:38,652 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:38,896 INFO L93 Difference]: Finished difference Result 223 states and 331 transitions. [2025-03-03 22:41:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:41:38,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2025-03-03 22:41:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:38,899 INFO L225 Difference]: With dead ends: 223 [2025-03-03 22:41:38,901 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 22:41:38,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:41:38,902 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 147 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:38,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 686 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:41:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 22:41:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 70. [2025-03-03 22:41:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:41:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2025-03-03 22:41:38,915 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 114 [2025-03-03 22:41:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:38,915 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2025-03-03 22:41:38,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2025-03-03 22:41:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:41:38,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:38,918 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:38,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:41:38,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:38,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1767458642, now seen corresponding path program 1 times [2025-03-03 22:41:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:38,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015361524] [2025-03-03 22:41:38,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:38,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:41:38,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:41:38,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:38,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015361524] [2025-03-03 22:41:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015361524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:39,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:39,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:41:39,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979504470] [2025-03-03 22:41:39,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:39,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:41:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:39,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:41:39,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:41:39,183 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:39,454 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-03 22:41:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:41:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-03 22:41:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:39,459 INFO L225 Difference]: With dead ends: 230 [2025-03-03 22:41:39,459 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 22:41:39,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:41:39,460 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 163 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:39,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 581 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:41:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 22:41:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 68. [2025-03-03 22:41:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:41:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2025-03-03 22:41:39,486 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 115 [2025-03-03 22:41:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:39,486 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2025-03-03 22:41:39,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2025-03-03 22:41:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:41:39,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:39,487 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:39,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:41:39,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:39,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash -648842992, now seen corresponding path program 1 times [2025-03-03 22:41:39,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:39,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842332240] [2025-03-03 22:41:39,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:39,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:39,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:41:39,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:41:39,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:39,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-03 22:41:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:39,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842332240] [2025-03-03 22:41:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842332240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:41:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374541383] [2025-03-03 22:41:39,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:41:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:39,848 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-03 22:41:39,850 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-03 22:41:39,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:41:39,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:41:39,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:39,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:39,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:41:39,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:41:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 348 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:41:40,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:41:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 22:41:40,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374541383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:41:40,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:41:40,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-03 22:41:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105239983] [2025-03-03 22:41:40,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:41:40,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:41:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:40,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:41:40,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:41:40,418 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 22:41:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:40,788 INFO L93 Difference]: Finished difference Result 164 states and 238 transitions. [2025-03-03 22:41:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:41:40,788 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 115 [2025-03-03 22:41:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:40,790 INFO L225 Difference]: With dead ends: 164 [2025-03-03 22:41:40,790 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 22:41:40,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2025-03-03 22:41:40,791 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 114 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:40,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 244 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:41:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 22:41:40,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2025-03-03 22:41:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:41:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2025-03-03 22:41:40,813 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 115 [2025-03-03 22:41:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:40,813 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2025-03-03 22:41:40,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 22:41:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2025-03-03 22:41:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 22:41:40,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:40,815 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:40,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:41:41,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:41:41,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:41,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash -952282945, now seen corresponding path program 1 times [2025-03-03 22:41:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571311411] [2025-03-03 22:41:41,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:41,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 22:41:41,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 22:41:41,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:41,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:42,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:42,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571311411] [2025-03-03 22:41:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571311411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:42,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:41:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707747773] [2025-03-03 22:41:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:42,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:41:42,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:42,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:41:42,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:41:42,231 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:42,812 INFO L93 Difference]: Finished difference Result 167 states and 224 transitions. [2025-03-03 22:41:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:41:42,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 22:41:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:42,816 INFO L225 Difference]: With dead ends: 167 [2025-03-03 22:41:42,816 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 22:41:42,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:41:42,817 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 195 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:42,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 488 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:41:42,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 22:41:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 122. [2025-03-03 22:41:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 84 states have internal predecessors, (98), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 22:41:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2025-03-03 22:41:42,841 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 116 [2025-03-03 22:41:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:42,841 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2025-03-03 22:41:42,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2025-03-03 22:41:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 22:41:42,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:42,843 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:42,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:41:42,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:42,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash -823200226, now seen corresponding path program 1 times [2025-03-03 22:41:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:42,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465795705] [2025-03-03 22:41:42,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:42,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 22:41:42,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 22:41:42,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:42,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-03 22:41:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465795705] [2025-03-03 22:41:43,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465795705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:41:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843234123] [2025-03-03 22:41:43,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:43,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:41:43,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:43,731 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-03 22:41:43,733 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-03 22:41:43,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 22:41:43,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 22:41:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:43,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 22:41:43,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:41:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 411 proven. 69 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-03 22:41:44,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:41:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 42 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-03 22:41:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843234123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:41:45,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:41:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 19] total 47 [2025-03-03 22:41:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441132509] [2025-03-03 22:41:45,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:41:45,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-03 22:41:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:45,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-03 22:41:45,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=1704, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 22:41:45,865 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 11 states have call predecessors, (43), 10 states have call successors, (43) [2025-03-03 22:41:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:47,533 INFO L93 Difference]: Finished difference Result 202 states and 255 transitions. [2025-03-03 22:41:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-03 22:41:47,534 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 11 states have call predecessors, (43), 10 states have call successors, (43) Word has length 116 [2025-03-03 22:41:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:47,536 INFO L225 Difference]: With dead ends: 202 [2025-03-03 22:41:47,537 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 22:41:47,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1193, Invalid=4063, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 22:41:47,540 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 288 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:47,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 615 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:41:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 22:41:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 147. [2025-03-03 22:41:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.153061224489796) internal successors, (113), 100 states have internal predecessors, (113), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 22:41:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 189 transitions. [2025-03-03 22:41:47,566 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 189 transitions. Word has length 116 [2025-03-03 22:41:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:47,566 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 189 transitions. [2025-03-03 22:41:47,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 46 states have internal predecessors, (96), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 11 states have call predecessors, (43), 10 states have call successors, (43) [2025-03-03 22:41:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 189 transitions. [2025-03-03 22:41:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 22:41:47,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:47,569 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:47,576 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-03 22:41:47,770 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,SelfDestructingSolverStorable5 [2025-03-03 22:41:47,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:47,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash -801017960, now seen corresponding path program 1 times [2025-03-03 22:41:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:47,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944200473] [2025-03-03 22:41:47,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:47,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:47,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 22:41:47,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 22:41:47,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:47,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:47,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:47,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944200473] [2025-03-03 22:41:47,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944200473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:47,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:47,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:41:47,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159283592] [2025-03-03 22:41:47,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:47,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:41:47,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:47,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:41:47,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:41:47,807 INFO L87 Difference]: Start difference. First operand 147 states and 189 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:47,840 INFO L93 Difference]: Finished difference Result 272 states and 344 transitions. [2025-03-03 22:41:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:41:47,841 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2025-03-03 22:41:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:47,842 INFO L225 Difference]: With dead ends: 272 [2025-03-03 22:41:47,843 INFO L226 Difference]: Without dead ends: 148 [2025-03-03 22:41:47,843 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-03 22:41:47,844 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:47,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 154 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:41:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-03 22:41:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2025-03-03 22:41:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 92 states have internal predecessors, (101), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 22:41:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2025-03-03 22:41:47,865 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 118 [2025-03-03 22:41:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:47,865 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2025-03-03 22:41:47,865 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2025-03-03 22:41:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 22:41:47,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:47,866 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:47,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:41:47,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1071874089, now seen corresponding path program 1 times [2025-03-03 22:41:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:47,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558834592] [2025-03-03 22:41:47,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:47,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:47,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 22:41:47,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 22:41:47,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:47,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:47,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558834592] [2025-03-03 22:41:47,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558834592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:47,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:41:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24481044] [2025-03-03 22:41:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:47,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:41:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:47,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:41:47,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:41:47,913 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:41:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:47,993 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2025-03-03 22:41:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:41:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2025-03-03 22:41:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:47,995 INFO L225 Difference]: With dead ends: 255 [2025-03-03 22:41:47,995 INFO L226 Difference]: Without dead ends: 139 [2025-03-03 22:41:47,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:41:47,996 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:47,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 65 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:41:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-03 22:41:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-03 22:41:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.1) internal successors, (99), 92 states have internal predecessors, (99), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 22:41:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 175 transitions. [2025-03-03 22:41:48,015 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 175 transitions. Word has length 118 [2025-03-03 22:41:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:48,015 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 175 transitions. [2025-03-03 22:41:48,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:41:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions. [2025-03-03 22:41:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 22:41:48,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:48,016 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:48,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:41:48,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:48,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:48,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1155142636, now seen corresponding path program 1 times [2025-03-03 22:41:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:48,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091759512] [2025-03-03 22:41:48,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:48,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:48,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 22:41:48,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 22:41:48,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:48,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091759512] [2025-03-03 22:41:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091759512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:48,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:48,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:41:48,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39320940] [2025-03-03 22:41:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:48,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:41:48,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:48,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:41:48,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:41:48,079 INFO L87 Difference]: Start difference. First operand 139 states and 175 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:48,216 INFO L93 Difference]: Finished difference Result 404 states and 502 transitions. [2025-03-03 22:41:48,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:41:48,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-03 22:41:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:48,218 INFO L225 Difference]: With dead ends: 404 [2025-03-03 22:41:48,218 INFO L226 Difference]: Without dead ends: 288 [2025-03-03 22:41:48,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:41:48,218 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 100 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:48,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 254 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:41:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-03 22:41:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 274. [2025-03-03 22:41:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 180 states have (on average 1.1166666666666667) internal successors, (201), 183 states have internal predecessors, (201), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:41:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 345 transitions. [2025-03-03 22:41:48,244 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 345 transitions. Word has length 119 [2025-03-03 22:41:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:48,244 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 345 transitions. [2025-03-03 22:41:48,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 345 transitions. [2025-03-03 22:41:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 22:41:48,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:48,246 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:48,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:41:48,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:48,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1617153956, now seen corresponding path program 1 times [2025-03-03 22:41:48,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:48,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519055259] [2025-03-03 22:41:48,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:48,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 22:41:48,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 22:41:48,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:48,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:48,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:48,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519055259] [2025-03-03 22:41:48,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519055259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:48,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:48,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:41:48,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787096499] [2025-03-03 22:41:48,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:48,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:41:48,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:48,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:41:48,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:41:48,284 INFO L87 Difference]: Start difference. First operand 274 states and 345 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:41:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:48,359 INFO L93 Difference]: Finished difference Result 391 states and 490 transitions. [2025-03-03 22:41:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:41:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2025-03-03 22:41:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:48,361 INFO L225 Difference]: With dead ends: 391 [2025-03-03 22:41:48,361 INFO L226 Difference]: Without dead ends: 275 [2025-03-03 22:41:48,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:41:48,362 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 62 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:48,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 111 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:41:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-03 22:41:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-03 22:41:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 181 states have (on average 1.1104972375690607) internal successors, (201), 184 states have internal predecessors, (201), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:41:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 345 transitions. [2025-03-03 22:41:48,390 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 345 transitions. Word has length 120 [2025-03-03 22:41:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:48,391 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 345 transitions. [2025-03-03 22:41:48,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:41:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 345 transitions. [2025-03-03 22:41:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 22:41:48,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:48,392 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:48,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:41:48,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:48,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1936388705, now seen corresponding path program 1 times [2025-03-03 22:41:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:48,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996482930] [2025-03-03 22:41:48,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:48,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 22:41:48,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 22:41:48,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:48,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996482930] [2025-03-03 22:41:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996482930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:41:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940569641] [2025-03-03 22:41:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:48,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:41:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:48,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:41:48,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:41:48,433 INFO L87 Difference]: Start difference. First operand 275 states and 345 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:48,474 INFO L93 Difference]: Finished difference Result 527 states and 658 transitions. [2025-03-03 22:41:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:41:48,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2025-03-03 22:41:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:48,476 INFO L225 Difference]: With dead ends: 527 [2025-03-03 22:41:48,476 INFO L226 Difference]: Without dead ends: 275 [2025-03-03 22:41:48,477 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-03 22:41:48,477 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:48,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 145 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:41:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-03 22:41:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-03 22:41:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 181 states have (on average 1.0939226519337018) internal successors, (198), 184 states have internal predecessors, (198), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:41:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 342 transitions. [2025-03-03 22:41:48,522 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 342 transitions. Word has length 120 [2025-03-03 22:41:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:48,522 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 342 transitions. [2025-03-03 22:41:48,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 342 transitions. [2025-03-03 22:41:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 22:41:48,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:48,523 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 22:41:48,523 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:48,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1447256344, now seen corresponding path program 1 times [2025-03-03 22:41:48,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:48,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926978452] [2025-03-03 22:41:48,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:48,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:48,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 22:41:48,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 22:41:48,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:48,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:49,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:49,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926978452] [2025-03-03 22:41:49,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926978452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:49,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:41:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078729636] [2025-03-03 22:41:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:49,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:41:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:49,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:41:49,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:41:49,390 INFO L87 Difference]: Start difference. First operand 275 states and 342 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:41:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:49,979 INFO L93 Difference]: Finished difference Result 454 states and 560 transitions. [2025-03-03 22:41:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 22:41:49,980 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2025-03-03 22:41:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:49,983 INFO L225 Difference]: With dead ends: 454 [2025-03-03 22:41:49,983 INFO L226 Difference]: Without dead ends: 452 [2025-03-03 22:41:49,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:41:49,983 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:49,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 417 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:41:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-03 22:41:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 322. [2025-03-03 22:41:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 228 states have (on average 1.1228070175438596) internal successors, (256), 231 states have internal predecessors, (256), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:41:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 400 transitions. [2025-03-03 22:41:50,023 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 400 transitions. Word has length 123 [2025-03-03 22:41:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:50,023 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 400 transitions. [2025-03-03 22:41:50,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:41:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 400 transitions. [2025-03-03 22:41:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 22:41:50,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:50,025 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:50,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 22:41:50,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:50,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2003239081, now seen corresponding path program 1 times [2025-03-03 22:41:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:50,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561900111] [2025-03-03 22:41:50,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:50,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 22:41:50,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 22:41:50,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:50,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 135 proven. 33 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-03 22:41:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561900111] [2025-03-03 22:41:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561900111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:41:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531895272] [2025-03-03 22:41:50,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:50,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:41:50,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:50,804 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-03 22:41:50,806 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-03 22:41:50,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 22:41:50,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 22:41:50,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:50,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:50,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-03 22:41:50,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:41:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 480 proven. 33 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-03 22:41:51,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:41:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 22:41:52,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531895272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:41:52,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:41:52,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 17] total 42 [2025-03-03 22:41:52,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699004542] [2025-03-03 22:41:52,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:41:52,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 22:41:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:52,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 22:41:52,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 22:41:52,472 INFO L87 Difference]: Start difference. First operand 322 states and 400 transitions. Second operand has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2025-03-03 22:41:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:53,637 INFO L93 Difference]: Finished difference Result 372 states and 452 transitions. [2025-03-03 22:41:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 22:41:53,637 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 123 [2025-03-03 22:41:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:53,639 INFO L225 Difference]: With dead ends: 372 [2025-03-03 22:41:53,639 INFO L226 Difference]: Without dead ends: 370 [2025-03-03 22:41:53,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=679, Invalid=2513, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 22:41:53,640 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:53,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 553 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:41:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-03 22:41:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 282. [2025-03-03 22:41:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 192 states have (on average 1.0885416666666667) internal successors, (209), 195 states have internal predecessors, (209), 67 states have call successors, (67), 22 states have call predecessors, (67), 22 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-03 22:41:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 343 transitions. [2025-03-03 22:41:53,676 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 343 transitions. Word has length 123 [2025-03-03 22:41:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:53,676 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 343 transitions. [2025-03-03 22:41:53,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2025-03-03 22:41:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 343 transitions. [2025-03-03 22:41:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 22:41:53,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:53,677 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:53,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 22:41:53,882 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-03 22:41:53,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1182532768, now seen corresponding path program 1 times [2025-03-03 22:41:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134694817] [2025-03-03 22:41:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:53,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 22:41:53,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 22:41:53,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:53,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:53,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:53,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134694817] [2025-03-03 22:41:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134694817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:53,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:41:53,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313457057] [2025-03-03 22:41:53,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:53,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:41:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:53,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:41:53,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:41:53,925 INFO L87 Difference]: Start difference. First operand 282 states and 343 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:53,978 INFO L93 Difference]: Finished difference Result 624 states and 753 transitions. [2025-03-03 22:41:53,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:41:53,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2025-03-03 22:41:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:53,981 INFO L225 Difference]: With dead ends: 624 [2025-03-03 22:41:53,981 INFO L226 Difference]: Without dead ends: 365 [2025-03-03 22:41:53,982 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-03 22:41:53,982 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:53,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 207 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:41:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-03 22:41:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 341. [2025-03-03 22:41:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 226 states have (on average 1.0707964601769913) internal successors, (242), 230 states have internal predecessors, (242), 85 states have call successors, (85), 29 states have call predecessors, (85), 29 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 22:41:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 412 transitions. [2025-03-03 22:41:54,035 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 412 transitions. Word has length 124 [2025-03-03 22:41:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:54,036 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 412 transitions. [2025-03-03 22:41:54,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 412 transitions. [2025-03-03 22:41:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 22:41:54,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:54,039 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:54,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 22:41:54,039 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:54,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 375308278, now seen corresponding path program 1 times [2025-03-03 22:41:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:54,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378909785] [2025-03-03 22:41:54,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:54,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 22:41:54,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 22:41:54,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:54,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 22:41:54,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378909785] [2025-03-03 22:41:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378909785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:41:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910439360] [2025-03-03 22:41:54,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:41:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:41:54,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:41:54,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 22:41:54,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 22:41:54,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 22:41:54,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:54,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:54,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:41:54,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:41:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 323 proven. 24 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 22:41:54,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:41:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 22:41:54,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910439360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:41:54,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:41:54,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-03-03 22:41:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417694297] [2025-03-03 22:41:54,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:41:54,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 22:41:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:54,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 22:41:54,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:41:54,517 INFO L87 Difference]: Start difference. First operand 341 states and 412 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) [2025-03-03 22:41:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:55,260 INFO L93 Difference]: Finished difference Result 1045 states and 1262 transitions. [2025-03-03 22:41:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 22:41:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) Word has length 124 [2025-03-03 22:41:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:55,264 INFO L225 Difference]: With dead ends: 1045 [2025-03-03 22:41:55,264 INFO L226 Difference]: Without dead ends: 727 [2025-03-03 22:41:55,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 22:41:55,266 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 236 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:55,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 628 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:41:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-03 22:41:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 316. [2025-03-03 22:41:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 213 states have (on average 1.0704225352112675) internal successors, (228), 216 states have internal predecessors, (228), 75 states have call successors, (75), 27 states have call predecessors, (75), 27 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 22:41:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 378 transitions. [2025-03-03 22:41:55,310 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 378 transitions. Word has length 124 [2025-03-03 22:41:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:55,311 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 378 transitions. [2025-03-03 22:41:55,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) [2025-03-03 22:41:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 378 transitions. [2025-03-03 22:41:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 22:41:55,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:55,312 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:55,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 22:41:55,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 22:41:55,513 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:55,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash -226424388, now seen corresponding path program 1 times [2025-03-03 22:41:55,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341409811] [2025-03-03 22:41:55,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:55,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:55,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:41:55,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:41:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:41:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:41:56,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:41:56,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341409811] [2025-03-03 22:41:56,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341409811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:41:56,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:41:56,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:41:56,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891663312] [2025-03-03 22:41:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:41:56,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:41:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:41:56,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:41:56,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:41:56,227 INFO L87 Difference]: Start difference. First operand 316 states and 378 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:41:56,597 INFO L93 Difference]: Finished difference Result 746 states and 895 transitions. [2025-03-03 22:41:56,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:41:56,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2025-03-03 22:41:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:41:56,600 INFO L225 Difference]: With dead ends: 746 [2025-03-03 22:41:56,600 INFO L226 Difference]: Without dead ends: 555 [2025-03-03 22:41:56,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:41:56,601 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 167 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:41:56,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 500 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:41:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-03 22:41:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 340. [2025-03-03 22:41:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 237 states have (on average 1.0928270042194093) internal successors, (259), 240 states have internal predecessors, (259), 75 states have call successors, (75), 27 states have call predecessors, (75), 27 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 22:41:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 409 transitions. [2025-03-03 22:41:56,641 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 409 transitions. Word has length 125 [2025-03-03 22:41:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:41:56,641 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 409 transitions. [2025-03-03 22:41:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:41:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 409 transitions. [2025-03-03 22:41:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 22:41:56,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:41:56,642 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:41:56,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 22:41:56,642 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:41:56,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:41:56,643 INFO L85 PathProgramCache]: Analyzing trace with hash 127717943, now seen corresponding path program 1 times [2025-03-03 22:41:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:41:56,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141728] [2025-03-03 22:41:56,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:41:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:41:56,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:41:56,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:41:56,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:56,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:41:56,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:41:56,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 22:41:56,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 22:41:56,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:41:56,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:41:56,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:41:56,709 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:41:56,710 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:41:56,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 22:41:56,713 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:41:56,779 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:41:56,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:41:56 BoogieIcfgContainer [2025-03-03 22:41:56,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:41:56,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:41:56,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:41:56,785 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:41:56,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:37" (3/4) ... [2025-03-03 22:41:56,787 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:41:56,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:41:56,788 INFO L158 Benchmark]: Toolchain (without parser) took 20138.87ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 123.4MB in the beginning and 353.9MB in the end (delta: -230.5MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2025-03-03 22:41:56,788 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:56,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.56ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 110.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:41:56,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.50ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:41:56,788 INFO L158 Benchmark]: Boogie Preprocessor took 26.90ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:56,789 INFO L158 Benchmark]: IcfgBuilder took 359.98ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 88.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:41:56,789 INFO L158 Benchmark]: TraceAbstraction took 19516.54ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 87.7MB in the beginning and 354.1MB in the end (delta: -266.3MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2025-03-03 22:41:56,789 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 486.5MB. Free memory was 354.1MB in the beginning and 353.9MB in the end (delta: 152.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:41:56,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.56ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 110.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.50ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.90ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 359.98ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 88.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19516.54ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 87.7MB in the beginning and 354.1MB in the end (delta: -266.3MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 486.5MB. Free memory was 354.1MB in the beginning and 353.9MB in the end (delta: 152.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of bitwiseOr at line 51, overapproximation of bitwiseOr at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed short int var_1_7 = 32; [L24] signed short int var_1_8 = 20113; [L25] signed short int var_1_9 = 100; [L26] signed char var_1_10 = 100; [L27] signed char var_1_11 = -1; [L28] signed char var_1_12 = 16; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 1; [L32] unsigned short int var_1_18 = 10; [L33] unsigned short int var_1_19 = 256; [L34] signed long int var_1_20 = 32; [L35] signed long int var_1_21 = 127; [L36] signed short int var_1_22 = 128; VAL [isInitial=0, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32, var_1_8=20113, var_1_9=100] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L72] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L73] var_1_8 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L75] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L76] var_1_9 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L78] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L78] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L79] var_1_11 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L82] var_1_12 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L88] var_1_16 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L91] var_1_19 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L94] var_1_21 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_21 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L95] RET assume_abort_if_not(var_1_21 >= -2147483648) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L96] CALL assume_abort_if_not(var_1_21 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L96] RET assume_abort_if_not(var_1_21 <= 2147483647) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L109] RET updateVariables() [L110] CALL step() [L40] var_1_18 = var_1_19 [L41] var_1_20 = var_1_21 [L42] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L43] COND TRUE 127.5f > var_1_20 [L44] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L48] COND FALSE !(var_1_18 == var_1_7) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L51] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L51] COND FALSE !(((32 * -25) | var_1_22) >= var_1_11) [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L58] COND TRUE var_1_10 > var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L59] COND TRUE \read(var_1_13) [L60] var_1_1 = (var_1_7 - (var_1_8 - var_1_9)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L101] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L101] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L101] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L101] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L101-L102] return (((((var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1))) && ((127.5f > var_1_20) ? (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))) : (var_1_13 == ((unsigned char) ((var_1_20 >= var_1_20) || var_1_15))))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((signed short int) var_1_12)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-16384, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 17, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2125 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2052 mSDsluCounter, 6137 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4461 mSDsCounter, 690 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6596 IncrementalHoareTripleChecker+Invalid, 7286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 690 mSolverCounterUnsat, 1676 mSDtfsCounter, 6596 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1189 GetRequests, 932 SyntacticMatches, 3 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2737 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=14, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 1236 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 2506 NumberOfCodeBlocks, 2506 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2835 ConstructedInterpolants, 0 QuantifiedInterpolants, 12659 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 14268/14688 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-03 22:41:56,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.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 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:41:58,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:41:58,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:41:58,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:41:58,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:41:58,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:41:58,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:41:58,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:41:58,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:41:58,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:41:58,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:41:58,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:41:58,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:41:58,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:41:58,867 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:41:58,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:41:58,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:41:58,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:41:58,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:41:58,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:41:58,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:41:58,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:41:58,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:41:58,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:41:58,869 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:41:58,869 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:41:58,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:41:58,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:41:58,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:41:58,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:41:58,869 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 -> 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 [2025-03-03 22:41:59,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:41:59,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:41:59,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:41:59,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:41:59,134 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:41:59,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2025-03-03 22:42:00,340 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eacc0080e/7ff378a2911f4437b58d271073ea84c7/FLAGb7ade178a [2025-03-03 22:42:00,547 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:42:00,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2025-03-03 22:42:00,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eacc0080e/7ff378a2911f4437b58d271073ea84c7/FLAGb7ade178a [2025-03-03 22:42:00,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eacc0080e/7ff378a2911f4437b58d271073ea84c7 [2025-03-03 22:42:00,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:42:00,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:42:00,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:42:00,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:42:00,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:42:00,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a4a1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00, skipping insertion in model container [2025-03-03 22:42:00,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:42:00,695 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2025-03-03 22:42:00,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:42:00,744 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:42:00,751 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2025-03-03 22:42:00,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:42:00,780 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:42:00,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00 WrapperNode [2025-03-03 22:42:00,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:42:00,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:42:00,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:42:00,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:42:00,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,807 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-03 22:42:00,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:42:00,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:42:00,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:42:00,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:42:00,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,824 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-03 22:42:00,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:42:00,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:42:00,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:42:00,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:42:00,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (1/1) ... [2025-03-03 22:42:00,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:42:00,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:42:00,862 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-03 22:42:00,864 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-03 22:42:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:42:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:42:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:42:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:42:00,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:42:00,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:42:00,941 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:42:00,943 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:42:01,235 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:42:01,235 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:42:01,242 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:42:01,243 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:42:01,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:42:01 BoogieIcfgContainer [2025-03-03 22:42:01,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:42:01,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:42:01,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:42:01,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:42:01,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:42:00" (1/3) ... [2025-03-03 22:42:01,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480ee67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:42:01, skipping insertion in model container [2025-03-03 22:42:01,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:42:00" (2/3) ... [2025-03-03 22:42:01,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480ee67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:42:01, skipping insertion in model container [2025-03-03 22:42:01,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:42:01" (3/3) ... [2025-03-03 22:42:01,250 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-97.i [2025-03-03 22:42:01,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:42:01,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-97.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:42:01,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:42:01,308 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;@48de007d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:42:01,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:42:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:42:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 22:42:01,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:42:01,322 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:42:01,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:42:01,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:42:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1261010912, now seen corresponding path program 1 times [2025-03-03 22:42:01,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:42:01,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188095429] [2025-03-03 22:42:01,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:42:01,337 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-03 22:42:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:42:01,342 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-03 22:42:01,344 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-03 22:42:01,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 22:42:01,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 22:42:01,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:42:01,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:42:01,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:42:01,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:42:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-03 22:42:01,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:42:01,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:42:01,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188095429] [2025-03-03 22:42:01,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188095429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:42:01,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:42:01,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:42:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85098281] [2025-03-03 22:42:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:42:01,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:42:01,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:42:01,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:42:01,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:42:01,559 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:42:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:42:01,578 INFO L93 Difference]: Finished difference Result 98 states and 169 transitions. [2025-03-03 22:42:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:42:01,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2025-03-03 22:42:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:42:01,602 INFO L225 Difference]: With dead ends: 98 [2025-03-03 22:42:01,602 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 22:42:01,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-03 22:42:01,611 INFO L435 NwaCegarLoop]: 73 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, 73 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-03 22:42:01,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:42:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 22:42:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 22:42:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:42:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2025-03-03 22:42:01,646 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 111 [2025-03-03 22:42:01,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:42:01,646 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2025-03-03 22:42:01,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:42:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2025-03-03 22:42:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 22:42:01,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:42:01,652 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:42:01,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:42:01,853 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-03 22:42:01,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:42:01,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:42:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1601347712, now seen corresponding path program 1 times [2025-03-03 22:42:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:42:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880941233] [2025-03-03 22:42:01,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:42:01,855 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-03 22:42:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:42:01,857 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-03 22:42:01,857 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-03 22:42:01,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 22:42:01,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 22:42:01,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:42:01,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:42:01,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:42:01,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:42:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 348 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:42:02,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:42:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 22:42:02,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:42:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880941233] [2025-03-03 22:42:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880941233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:42:02,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:42:02,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-03-03 22:42:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138469559] [2025-03-03 22:42:02,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:42:02,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:42:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:42:02,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:42:02,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:42:02,636 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 22:42:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:42:03,423 INFO L93 Difference]: Finished difference Result 127 states and 185 transitions. [2025-03-03 22:42:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:42:03,424 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2025-03-03 22:42:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:42:03,425 INFO L225 Difference]: With dead ends: 127 [2025-03-03 22:42:03,426 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 22:42:03,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2025-03-03 22:42:03,427 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 182 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:42:03,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 169 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:42:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 22:42:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2025-03-03 22:42:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 22:42:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2025-03-03 22:42:03,438 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 111 [2025-03-03 22:42:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:42:03,438 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2025-03-03 22:42:03,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 22:42:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2025-03-03 22:42:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 22:42:03,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:42:03,439 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:42:03,444 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-03 22:42:03,640 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-03 22:42:03,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:42:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:42:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1923625527, now seen corresponding path program 1 times [2025-03-03 22:42:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:42:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227908295] [2025-03-03 22:42:03,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:42:03,642 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-03 22:42:03,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:42:03,645 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-03 22:42:03,646 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-03 22:42:03,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 22:42:03,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 22:42:03,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:42:03,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:42:03,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 22:42:03,756 INFO L279 TraceCheckSpWp]: Computing forward predicates...