./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.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_codestructure_steplocals_file-84.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 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:07:32,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:07:32,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:07:32,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:07:32,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:07:32,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:07:32,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:07:32,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:07:32,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:07:32,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:07:32,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:07:32,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:07:32,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:07:32,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:07:32,217 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:07:32,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:07:32,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:07:32,218 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:07:32,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:07:32,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:07:32,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:07:32,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:07:32,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:07:32,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:07:32,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:07:32,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:07:32,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:07:32,220 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 -> 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d [2025-03-03 19:07:32,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:07:32,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:07:32,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:07:32,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:07:32,448 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:07:32,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2025-03-03 19:07:33,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aea3d857/28119b2b973041cea76532c2e845a043/FLAGdd8af5536 [2025-03-03 19:07:33,880 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:07:33,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2025-03-03 19:07:33,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aea3d857/28119b2b973041cea76532c2e845a043/FLAGdd8af5536 [2025-03-03 19:07:34,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aea3d857/28119b2b973041cea76532c2e845a043 [2025-03-03 19:07:34,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:07:34,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:07:34,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:07:34,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:07:34,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:07:34,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344d3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34, skipping insertion in model container [2025-03-03 19:07:34,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:07:34,286 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_codestructure_steplocals_file-84.i[917,930] [2025-03-03 19:07:34,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:07:34,360 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:07:34,367 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_codestructure_steplocals_file-84.i[917,930] [2025-03-03 19:07:34,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:07:34,396 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:07:34,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34 WrapperNode [2025-03-03 19:07:34,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:07:34,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:07:34,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:07:34,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:07:34,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,444 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-03-03 19:07:34,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:07:34,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:07:34,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:07:34,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:07:34,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,474 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 19:07:34,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:07:34,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:07:34,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:07:34,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:07:34,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (1/1) ... [2025-03-03 19:07:34,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:07:34,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:07:34,524 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 19:07:34,527 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 19:07:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:07:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:07:34,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:07:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:07:34,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:07:34,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:07:34,605 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:07:34,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:07:34,880 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2025-03-03 19:07:34,910 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 19:07:34,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:07:34,930 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:07:34,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:07:34,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:07:34 BoogieIcfgContainer [2025-03-03 19:07:34,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:07:34,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:07:34,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:07:34,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:07:34,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:07:34" (1/3) ... [2025-03-03 19:07:34,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30515931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:07:34, skipping insertion in model container [2025-03-03 19:07:34,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:07:34" (2/3) ... [2025-03-03 19:07:34,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30515931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:07:34, skipping insertion in model container [2025-03-03 19:07:34,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:07:34" (3/3) ... [2025-03-03 19:07:34,939 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-84.i [2025-03-03 19:07:34,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:07:34,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-84.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:07:34,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:07:35,008 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;@22a39284, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:07:35,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:07:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:07:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:07:35,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:35,026 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:35,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:35,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1300620674, now seen corresponding path program 1 times [2025-03-03 19:07:35,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:35,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060821765] [2025-03-03 19:07:35,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:07:35,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:07:35,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:35,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 19:07:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:07:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060821765] [2025-03-03 19:07:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060821765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:07:35,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236522591] [2025-03-03 19:07:35,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:35,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:07:35,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:07:35,281 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 19:07:35,283 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 19:07:35,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:07:35,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:07:35,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:35,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:35,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:07:35,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:07:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 19:07:35,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:07:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236522591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:07:35,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:07:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:07:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053908105] [2025-03-03 19:07:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:07:35,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:07:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:07:35,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:07:35,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:07:35,476 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:07:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:07:35,509 INFO L93 Difference]: Finished difference Result 166 states and 283 transitions. [2025-03-03 19:07:35,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:07:35,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2025-03-03 19:07:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:07:35,515 INFO L225 Difference]: With dead ends: 166 [2025-03-03 19:07:35,515 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 19:07:35,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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 19:07:35,519 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:07:35,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:07:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 19:07:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 19:07:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:07:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2025-03-03 19:07:35,548 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 167 [2025-03-03 19:07:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:07:35,551 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2025-03-03 19:07:35,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:07:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2025-03-03 19:07:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:07:35,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:35,558 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:35,565 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 19:07:35,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:07:35,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:35,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:35,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2038659712, now seen corresponding path program 1 times [2025-03-03 19:07:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:35,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091583199] [2025-03-03 19:07:35,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:35,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:35,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:07:35,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:07:35,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:35,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:07:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:07:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091583199] [2025-03-03 19:07:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091583199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:07:42,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:07:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:07:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415778239] [2025-03-03 19:07:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:07:42,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:07:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:07:42,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:07:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:07:42,291 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:07:44,385 INFO L93 Difference]: Finished difference Result 231 states and 347 transitions. [2025-03-03 19:07:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:07:44,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2025-03-03 19:07:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:07:44,390 INFO L225 Difference]: With dead ends: 231 [2025-03-03 19:07:44,390 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 19:07:44,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:07:44,391 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 88 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:07:44,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 392 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 19:07:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 19:07:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 99. [2025-03-03 19:07:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:07:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2025-03-03 19:07:44,404 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 167 [2025-03-03 19:07:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:07:44,406 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2025-03-03 19:07:44,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2025-03-03 19:07:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:07:44,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:44,407 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:44,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:07:44,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:44,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 35767749, now seen corresponding path program 1 times [2025-03-03 19:07:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528660761] [2025-03-03 19:07:44,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:44,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:07:44,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:07:44,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:44,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:07:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:07:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528660761] [2025-03-03 19:07:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528660761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:07:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:07:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:07:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052610466] [2025-03-03 19:07:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:07:45,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:07:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:07:45,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:07:45,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:07:45,632 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:07:45,966 INFO L93 Difference]: Finished difference Result 231 states and 350 transitions. [2025-03-03 19:07:45,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:07:45,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-03-03 19:07:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:07:45,971 INFO L225 Difference]: With dead ends: 231 [2025-03-03 19:07:45,971 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 19:07:45,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:07:45,972 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 136 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:07:45,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 369 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:07:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 19:07:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 99. [2025-03-03 19:07:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:07:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2025-03-03 19:07:45,984 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 168 [2025-03-03 19:07:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:07:45,985 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2025-03-03 19:07:45,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2025-03-03 19:07:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:07:45,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:45,990 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:45,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:07:45,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:45,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash -961304604, now seen corresponding path program 1 times [2025-03-03 19:07:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:45,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24422526] [2025-03-03 19:07:45,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:45,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:45,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:07:46,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:07:46,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:46,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:07:48,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:07:48,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24422526] [2025-03-03 19:07:48,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24422526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:07:48,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:07:48,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:07:48,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578110307] [2025-03-03 19:07:48,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:07:48,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:07:48,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:07:48,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:07:48,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:07:48,363 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:07:49,036 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2025-03-03 19:07:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:07:49,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-03-03 19:07:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:07:49,039 INFO L225 Difference]: With dead ends: 231 [2025-03-03 19:07:49,039 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 19:07:49,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:07:49,040 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:07:49,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 332 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:07:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 19:07:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2025-03-03 19:07:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:07:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-03-03 19:07:49,050 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 168 [2025-03-03 19:07:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:07:49,051 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-03-03 19:07:49,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-03-03 19:07:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 19:07:49,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:49,052 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:49,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:07:49,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:49,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:49,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1871222530, now seen corresponding path program 1 times [2025-03-03 19:07:49,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:49,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140616861] [2025-03-03 19:07:49,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:49,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:49,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:07:49,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:07:49,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:49,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:07:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:07:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140616861] [2025-03-03 19:07:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140616861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:07:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:07:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:07:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598766998] [2025-03-03 19:07:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:07:51,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:07:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:07:51,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:07:51,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:07:51,401 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:07:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:07:52,432 INFO L93 Difference]: Finished difference Result 353 states and 512 transitions. [2025-03-03 19:07:52,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:07:52,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-03-03 19:07:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:07:52,435 INFO L225 Difference]: With dead ends: 353 [2025-03-03 19:07:52,435 INFO L226 Difference]: Without dead ends: 273 [2025-03-03 19:07:52,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:07:52,437 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 517 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:07:52,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 596 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:07:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-03 19:07:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 241. [2025-03-03 19:07:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 178 states have (on average 1.3426966292134832) internal successors, (239), 180 states have internal predecessors, (239), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 19:07:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 355 transitions. [2025-03-03 19:07:52,475 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 355 transitions. Word has length 169 [2025-03-03 19:07:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:07:52,476 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 355 transitions. [2025-03-03 19:07:52,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:07:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 355 transitions. [2025-03-03 19:07:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 19:07:52,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:52,478 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:52,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:07:52,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:52,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:52,479 INFO L85 PathProgramCache]: Analyzing trace with hash -363670721, now seen corresponding path program 1 times [2025-03-03 19:07:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:52,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192944711] [2025-03-03 19:07:52,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:52,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:07:52,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:07:52,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:52,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:07:54,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:07:54,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192944711] [2025-03-03 19:07:54,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192944711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:07:54,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:07:54,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:07:54,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004116501] [2025-03-03 19:07:54,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:07:54,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:07:54,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:07:54,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:07:54,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:07:54,447 INFO L87 Difference]: Start difference. First operand 241 states and 355 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:07:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:07:55,311 INFO L93 Difference]: Finished difference Result 490 states and 716 transitions. [2025-03-03 19:07:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:07:55,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-03-03 19:07:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:07:55,314 INFO L225 Difference]: With dead ends: 490 [2025-03-03 19:07:55,314 INFO L226 Difference]: Without dead ends: 252 [2025-03-03 19:07:55,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:07:55,315 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 264 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:07:55,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 631 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:07:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-03 19:07:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232. [2025-03-03 19:07:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 171 states have internal predecessors, (226), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 19:07:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2025-03-03 19:07:55,331 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 169 [2025-03-03 19:07:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:07:55,332 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2025-03-03 19:07:55,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:07:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2025-03-03 19:07:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 19:07:55,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:55,333 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:55,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:07:55,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:55,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash -517912833, now seen corresponding path program 1 times [2025-03-03 19:07:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031064581] [2025-03-03 19:07:55,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:55,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:07:55,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:07:55,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:55,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:07:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:07:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031064581] [2025-03-03 19:07:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031064581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:07:56,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:07:56,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:07:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748174609] [2025-03-03 19:07:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:07:56,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:07:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:07:56,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:07:56,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:07:56,971 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:07:57,795 INFO L93 Difference]: Finished difference Result 513 states and 741 transitions. [2025-03-03 19:07:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:07:57,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-03 19:07:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:07:57,799 INFO L225 Difference]: With dead ends: 513 [2025-03-03 19:07:57,799 INFO L226 Difference]: Without dead ends: 284 [2025-03-03 19:07:57,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:07:57,801 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 233 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:07:57,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 635 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:07:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-03 19:07:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 219. [2025-03-03 19:07:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 158 states have internal predecessors, (208), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 19:07:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2025-03-03 19:07:57,828 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 169 [2025-03-03 19:07:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:07:57,830 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2025-03-03 19:07:57,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2025-03-03 19:07:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 19:07:57,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:57,832 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:57,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:07:57,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:57,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:57,833 INFO L85 PathProgramCache]: Analyzing trace with hash 989638976, now seen corresponding path program 1 times [2025-03-03 19:07:57,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:57,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413665506] [2025-03-03 19:07:57,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:57,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 19:07:57,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 19:07:57,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:57,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:07:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:07:59,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:07:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413665506] [2025-03-03 19:07:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413665506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:07:59,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:07:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:07:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138569130] [2025-03-03 19:07:59,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:07:59,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:07:59,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:07:59,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:07:59,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:07:59,101 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:07:59,680 INFO L93 Difference]: Finished difference Result 475 states and 691 transitions. [2025-03-03 19:07:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:07:59,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-03 19:07:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:07:59,684 INFO L225 Difference]: With dead ends: 475 [2025-03-03 19:07:59,684 INFO L226 Difference]: Without dead ends: 263 [2025-03-03 19:07:59,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:07:59,685 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 257 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:07:59,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 574 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:07:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-03 19:07:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 208. [2025-03-03 19:07:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 147 states have internal predecessors, (192), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 19:07:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 308 transitions. [2025-03-03 19:07:59,703 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 308 transitions. Word has length 169 [2025-03-03 19:07:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:07:59,703 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 308 transitions. [2025-03-03 19:07:59,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:07:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 308 transitions. [2025-03-03 19:07:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:07:59,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:07:59,705 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:59,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:07:59,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:07:59,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:07:59,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1211257853, now seen corresponding path program 1 times [2025-03-03 19:07:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:07:59,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585629154] [2025-03-03 19:07:59,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:07:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:07:59,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:07:59,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:07:59,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:07:59,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:08:04,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:08:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585629154] [2025-03-03 19:08:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585629154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:04,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:04,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:08:04,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66498695] [2025-03-03 19:08:04,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:04,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:08:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:08:04,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:08:04,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:08:04,842 INFO L87 Difference]: Start difference. First operand 208 states and 308 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:08:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:09,179 INFO L93 Difference]: Finished difference Result 411 states and 592 transitions. [2025-03-03 19:08:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:08:09,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2025-03-03 19:08:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:09,184 INFO L225 Difference]: With dead ends: 411 [2025-03-03 19:08:09,184 INFO L226 Difference]: Without dead ends: 331 [2025-03-03 19:08:09,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:08:09,185 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 294 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:08:09,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 620 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 19:08:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-03 19:08:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 301. [2025-03-03 19:08:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 227 states have (on average 1.3392070484581498) internal successors, (304), 231 states have internal predecessors, (304), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 19:08:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 436 transitions. [2025-03-03 19:08:09,216 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 436 transitions. Word has length 170 [2025-03-03 19:08:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:09,216 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 436 transitions. [2025-03-03 19:08:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:08:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 436 transitions. [2025-03-03 19:08:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:08:09,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:09,218 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:09,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:08:09,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 296293956, now seen corresponding path program 1 times [2025-03-03 19:08:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141219726] [2025-03-03 19:08:09,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:09,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:09,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:08:09,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:08:09,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:09,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:08:15,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:08:15,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141219726] [2025-03-03 19:08:15,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141219726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:15,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:15,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:08:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980870589] [2025-03-03 19:08:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:08:15,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:08:15,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:08:15,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:08:15,254 INFO L87 Difference]: Start difference. First operand 301 states and 436 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:08:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:19,094 INFO L93 Difference]: Finished difference Result 483 states and 694 transitions. [2025-03-03 19:08:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:08:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2025-03-03 19:08:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:19,096 INFO L225 Difference]: With dead ends: 483 [2025-03-03 19:08:19,096 INFO L226 Difference]: Without dead ends: 310 [2025-03-03 19:08:19,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:08:19,097 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 268 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:08:19,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 648 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 19:08:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-03 19:08:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 292. [2025-03-03 19:08:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 218 states have (on average 1.334862385321101) internal successors, (291), 222 states have internal predecessors, (291), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 19:08:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 423 transitions. [2025-03-03 19:08:19,114 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 423 transitions. Word has length 170 [2025-03-03 19:08:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:19,115 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 423 transitions. [2025-03-03 19:08:19,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:08:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 423 transitions. [2025-03-03 19:08:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:08:19,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:19,116 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:19,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:08:19,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1838231915, now seen corresponding path program 1 times [2025-03-03 19:08:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620373382] [2025-03-03 19:08:19,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:19,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:08:19,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:08:19,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:19,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:08:19,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:08:19,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620373382] [2025-03-03 19:08:19,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620373382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:19,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:19,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:08:19,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140619791] [2025-03-03 19:08:19,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:19,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:08:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:08:19,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:08:19,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:08:19,215 INFO L87 Difference]: Start difference. First operand 292 states and 423 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:08:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:19,323 INFO L93 Difference]: Finished difference Result 580 states and 840 transitions. [2025-03-03 19:08:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:08:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-03 19:08:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:19,326 INFO L225 Difference]: With dead ends: 580 [2025-03-03 19:08:19,326 INFO L226 Difference]: Without dead ends: 295 [2025-03-03 19:08:19,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:08:19,328 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 78 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:08:19,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 293 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:08:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-03 19:08:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2025-03-03 19:08:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 219 states have (on average 1.3333333333333333) internal successors, (292), 223 states have internal predecessors, (292), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 19:08:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 424 transitions. [2025-03-03 19:08:19,349 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 424 transitions. Word has length 170 [2025-03-03 19:08:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:19,349 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 424 transitions. [2025-03-03 19:08:19,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:08:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 424 transitions. [2025-03-03 19:08:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 19:08:19,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:19,351 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:19,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:08:19,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:19,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1789495218, now seen corresponding path program 1 times [2025-03-03 19:08:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:19,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086048112] [2025-03-03 19:08:19,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:19,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 19:08:19,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 19:08:19,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:19,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:08:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:08:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086048112] [2025-03-03 19:08:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086048112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:19,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:08:19,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862701265] [2025-03-03 19:08:19,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:19,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:08:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:08:19,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:08:19,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:08:19,393 INFO L87 Difference]: Start difference. First operand 293 states and 424 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:08:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:19,475 INFO L93 Difference]: Finished difference Result 747 states and 1065 transitions. [2025-03-03 19:08:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:08:19,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-03 19:08:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:19,478 INFO L225 Difference]: With dead ends: 747 [2025-03-03 19:08:19,479 INFO L226 Difference]: Without dead ends: 461 [2025-03-03 19:08:19,479 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 19:08:19,480 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 41 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:08:19,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 202 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:08:19,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-03 19:08:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 366. [2025-03-03 19:08:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 286 states have (on average 1.3426573426573427) internal successors, (384), 291 states have internal predecessors, (384), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:08:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 524 transitions. [2025-03-03 19:08:19,506 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 524 transitions. Word has length 170 [2025-03-03 19:08:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:19,506 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 524 transitions. [2025-03-03 19:08:19,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:08:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 524 transitions. [2025-03-03 19:08:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:08:19,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:19,507 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:19,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:08:19,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:19,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash 822300422, now seen corresponding path program 1 times [2025-03-03 19:08:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:19,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312811586] [2025-03-03 19:08:19,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:19,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:08:19,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:08:19,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:19,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 19:08:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:08:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312811586] [2025-03-03 19:08:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312811586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:19,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:19,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:08:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92151468] [2025-03-03 19:08:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:19,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:08:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:08:19,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:08:19,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:08:19,603 INFO L87 Difference]: Start difference. First operand 366 states and 524 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:08:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:19,699 INFO L93 Difference]: Finished difference Result 556 states and 799 transitions. [2025-03-03 19:08:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:08:19,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 19:08:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:19,702 INFO L225 Difference]: With dead ends: 556 [2025-03-03 19:08:19,702 INFO L226 Difference]: Without dead ends: 365 [2025-03-03 19:08:19,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:08:19,703 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 123 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:08:19,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 177 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:08:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-03 19:08:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-03 19:08:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 285 states have (on average 1.3333333333333333) internal successors, (380), 290 states have internal predecessors, (380), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:08:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 520 transitions. [2025-03-03 19:08:19,730 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 520 transitions. Word has length 171 [2025-03-03 19:08:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:19,730 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 520 transitions. [2025-03-03 19:08:19,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 19:08:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 520 transitions. [2025-03-03 19:08:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:08:19,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:19,731 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:19,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:08:19,731 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:19,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:19,732 INFO L85 PathProgramCache]: Analyzing trace with hash 520046460, now seen corresponding path program 1 times [2025-03-03 19:08:19,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:19,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906566443] [2025-03-03 19:08:19,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:19,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:08:19,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:08:19,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:19,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 39 proven. 105 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2025-03-03 19:08:19,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:08:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906566443] [2025-03-03 19:08:19,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906566443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:08:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503302307] [2025-03-03 19:08:19,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:19,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:08:19,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:08:19,968 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 19:08:19,970 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 19:08:20,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:08:20,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:08:20,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:20,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:20,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 19:08:20,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:08:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 702 proven. 105 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2025-03-03 19:08:20,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:08:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 39 proven. 108 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2025-03-03 19:08:21,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503302307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:08:21,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:08:21,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2025-03-03 19:08:21,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371024878] [2025-03-03 19:08:21,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:08:21,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 19:08:21,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:08:21,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 19:08:21,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2025-03-03 19:08:21,023 INFO L87 Difference]: Start difference. First operand 365 states and 520 transitions. Second operand has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 9 states have call successors, (78), 4 states have call predecessors, (78), 9 states have return successors, (78), 9 states have call predecessors, (78), 9 states have call successors, (78) [2025-03-03 19:08:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:22,677 INFO L93 Difference]: Finished difference Result 2761 states and 3713 transitions. [2025-03-03 19:08:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-03 19:08:22,678 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 9 states have call successors, (78), 4 states have call predecessors, (78), 9 states have return successors, (78), 9 states have call predecessors, (78), 9 states have call successors, (78) Word has length 171 [2025-03-03 19:08:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:22,688 INFO L225 Difference]: With dead ends: 2761 [2025-03-03 19:08:22,688 INFO L226 Difference]: Without dead ends: 2399 [2025-03-03 19:08:22,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1325, Invalid=3645, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 19:08:22,692 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 847 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:08:22,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 968 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:08:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2025-03-03 19:08:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1038. [2025-03-03 19:08:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 866 states have (on average 1.3198614318706698) internal successors, (1143), 879 states have internal predecessors, (1143), 146 states have call successors, (146), 25 states have call predecessors, (146), 25 states have return successors, (146), 133 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 19:08:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1435 transitions. [2025-03-03 19:08:22,780 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1435 transitions. Word has length 171 [2025-03-03 19:08:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:22,780 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1435 transitions. [2025-03-03 19:08:22,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 9 states have call successors, (78), 4 states have call predecessors, (78), 9 states have return successors, (78), 9 states have call predecessors, (78), 9 states have call successors, (78) [2025-03-03 19:08:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1435 transitions. [2025-03-03 19:08:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:08:22,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:22,783 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:22,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:08:22,983 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,SelfDestructingSolverStorable13 [2025-03-03 19:08:22,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:22,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1873356157, now seen corresponding path program 1 times [2025-03-03 19:08:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:08:22,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364932522] [2025-03-03 19:08:22,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:08:22,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:08:23,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:08:23,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:23,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:08:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611630921] [2025-03-03 19:08:23,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:23,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:08:23,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:08:23,033 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 19:08:23,036 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 19:08:23,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:08:23,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:08:23,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:23,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:08:23,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:08:23,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:08:23,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:08:23,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:23,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:08:23,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:08:23,231 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:08:23,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:08:23,241 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 19:08:23,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:08:23,436 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:08:23,533 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:08:23,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:08:23 BoogieIcfgContainer [2025-03-03 19:08:23,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:08:23,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:08:23,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:08:23,539 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:08:23,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:07:34" (3/4) ... [2025-03-03 19:08:23,542 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:08:23,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:08:23,544 INFO L158 Benchmark]: Toolchain (without parser) took 49365.94ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 121.8MB in the beginning and 654.7MB in the end (delta: -532.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-03-03 19:08:23,544 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:08:23,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.94ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 107.7MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:08:23,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.75ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 104.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:08:23,544 INFO L158 Benchmark]: Boogie Preprocessor took 50.12ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 100.0MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:08:23,544 INFO L158 Benchmark]: IcfgBuilder took 434.04ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 72.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:08:23,544 INFO L158 Benchmark]: TraceAbstraction took 48605.23ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 72.1MB in the beginning and 654.9MB in the end (delta: -582.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:08:23,545 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 729.8MB. Free memory was 654.9MB in the beginning and 654.7MB in the end (delta: 153.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:08:23,546 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.47ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.94ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 107.7MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.75ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 104.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.12ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 100.0MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 434.04ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 72.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 48605.23ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 72.1MB in the beginning and 654.9MB in the end (delta: -582.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 729.8MB. Free memory was 654.9MB in the beginning and 654.7MB in the end (delta: 153.2kB). Peak memory consumption was 8.4MB. 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 someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = -16; [L25] signed char var_1_4 = 50; [L26] signed char var_1_5 = 4; [L27] unsigned long int var_1_6 = 50; [L28] signed long int var_1_7 = -8; [L29] signed long int var_1_8 = -4; [L30] signed char var_1_9 = 50; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 5; [L33] unsigned long int var_1_12 = 10; [L34] signed char var_1_13 = 16; [L35] signed long int var_1_14 = 1; [L36] unsigned short int var_1_15 = 128; [L37] signed long int var_1_16 = 2; [L38] unsigned short int var_1_17 = 61498; [L39] unsigned long int var_1_18 = 1; [L40] unsigned char var_1_19 = 0; [L41] double var_1_20 = 4.9; [L42] double var_1_21 = 1.5; VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] FCALL updateLastVariables() [L133] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] var_1_3 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] var_1_4 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L92] var_1_5 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L95] var_1_7 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L96] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L97] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L98] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L99] var_1_8 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L102] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L103] var_1_10 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L105] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L109] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L109] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L110] var_1_14 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L111] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L112] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L113] var_1_16 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L115] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L117] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L118] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L118] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L119] var_1_21 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L120] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L133] RET updateVariables() [L134] CALL step() [L46] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L49] signed long int stepLocal_1 = -16; [L50] signed long int stepLocal_0 = var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))); VAL [isInitial=1, stepLocal_0=-4, stepLocal_1=-16, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L51] COND FALSE !(-4 > stepLocal_0) VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L56] EXPR var_1_8 & var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=50] [L56] COND FALSE !(var_1_6 <= (var_1_8 & var_1_4)) [L61] var_1_9 = var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L63] COND TRUE var_1_3 <= var_1_1 [L64] var_1_12 = var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L68] signed long int stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_1=-16, stepLocal_2=0, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L69] COND FALSE !((~ var_1_3) < stepLocal_2) VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L72] signed long int stepLocal_3 = var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))); VAL [isInitial=1, stepLocal_1=-16, stepLocal_3=127, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L73] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, stepLocal_1=-16, stepLocal_3=127, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L73] COND TRUE ((var_1_4 + var_1_14) & var_1_7) <= stepLocal_3 [L74] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L78] var_1_18 = var_1_17 [L79] var_1_19 = 0 [L80] var_1_20 = var_1_21 VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L125] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L125] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L125] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L125] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L125] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L125-L126] return ((((((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_2=0, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 15, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3271 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3256 mSDsluCounter, 6559 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4924 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8273 IncrementalHoareTripleChecker+Invalid, 8637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 1635 mSDtfsCounter, 8273 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1038occurred in iteration=14, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1818 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.6s InterpolantComputationTime, 3048 NumberOfCodeBlocks, 3048 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2860 ConstructedInterpolants, 0 QuantifiedInterpolants, 25715 SizeOfPredicates, 9 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 21732/22100 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 19:08:23,757 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_codestructure_steplocals_file-84.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 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:08:25,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:08:25,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:08:25,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:08:25,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:08:25,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:08:25,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:08:25,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:08:25,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:08:25,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:08:25,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:08:25,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:08:25,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:08:25,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:08:25,465 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:08:25,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:08:25,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:08:25,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:08:25,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:08:25,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:08:25,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:08:25,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:08:25,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:08:25,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:08:25,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:08:25,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:08:25,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:08:25,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:08:25,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:08:25,469 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 -> 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d [2025-03-03 19:08:25,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:08:25,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:08:25,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:08:25,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:08:25,708 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:08:25,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2025-03-03 19:08:26,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae81b65e/2b22d89dc7a249d3b21652f289617915/FLAGda51bf606 [2025-03-03 19:08:27,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:08:27,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2025-03-03 19:08:27,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae81b65e/2b22d89dc7a249d3b21652f289617915/FLAGda51bf606 [2025-03-03 19:08:27,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae81b65e/2b22d89dc7a249d3b21652f289617915 [2025-03-03 19:08:27,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:08:27,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:08:27,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:08:27,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:08:27,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:08:27,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c9f2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27, skipping insertion in model container [2025-03-03 19:08:27,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:08:27,284 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_codestructure_steplocals_file-84.i[917,930] [2025-03-03 19:08:27,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:08:27,361 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:08:27,369 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_codestructure_steplocals_file-84.i[917,930] [2025-03-03 19:08:27,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:08:27,407 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:08:27,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27 WrapperNode [2025-03-03 19:08:27,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:08:27,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:08:27,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:08:27,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:08:27,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,437 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-03-03 19:08:27,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:08:27,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:08:27,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:08:27,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:08:27,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,457 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 19:08:27,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:08:27,470 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:08:27,470 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:08:27,470 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:08:27,471 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (1/1) ... [2025-03-03 19:08:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:08:27,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:08:27,496 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 19:08:27,499 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 19:08:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:08:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:08:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:08:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:08:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:08:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:08:27,589 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:08:27,591 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:08:27,980 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 19:08:27,981 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:08:27,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:08:27,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:08:27,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:08:27 BoogieIcfgContainer [2025-03-03 19:08:27,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:08:27,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:08:27,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:08:27,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:08:27,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:08:27" (1/3) ... [2025-03-03 19:08:27,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57723ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:08:27, skipping insertion in model container [2025-03-03 19:08:27,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:08:27" (2/3) ... [2025-03-03 19:08:27,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57723ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:08:27, skipping insertion in model container [2025-03-03 19:08:27,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:08:27" (3/3) ... [2025-03-03 19:08:27,997 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-84.i [2025-03-03 19:08:28,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:08:28,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-84.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:08:28,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:08:28,064 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;@22954c00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:08:28,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:08:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:08:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 19:08:28,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:28,078 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:28,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -742550508, now seen corresponding path program 1 times [2025-03-03 19:08:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:08:28,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564057761] [2025-03-03 19:08:28,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:28,090 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 19:08:28,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:08:28,093 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 19:08:28,095 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 19:08:28,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 19:08:28,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 19:08:28,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:28,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:28,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:08:28,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:08:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-03 19:08:28,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:08:28,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:08:28,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564057761] [2025-03-03 19:08:28,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564057761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:08:28,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:08:28,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:08:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116069383] [2025-03-03 19:08:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:08:28,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:08:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:08:28,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:08:28,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:08:28,388 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:08:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:08:28,412 INFO L93 Difference]: Finished difference Result 130 states and 227 transitions. [2025-03-03 19:08:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:08:28,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2025-03-03 19:08:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:08:28,418 INFO L225 Difference]: With dead ends: 130 [2025-03-03 19:08:28,418 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 19:08:28,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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 19:08:28,422 INFO L435 NwaCegarLoop]: 98 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, 98 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 19:08:28,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:08:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 19:08:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 19:08:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 19:08:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 98 transitions. [2025-03-03 19:08:28,459 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 98 transitions. Word has length 161 [2025-03-03 19:08:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:08:28,460 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 98 transitions. [2025-03-03 19:08:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 19:08:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 98 transitions. [2025-03-03 19:08:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 19:08:28,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:08:28,464 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:28,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:08:28,667 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 19:08:28,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:08:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:08:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 842238610, now seen corresponding path program 1 times [2025-03-03 19:08:28,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:08:28,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581594420] [2025-03-03 19:08:28,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:08:28,669 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 19:08:28,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:08:28,672 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 19:08:28,673 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 19:08:28,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 19:08:28,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 19:08:28,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:08:28,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:08:28,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 19:08:28,912 INFO L279 TraceCheckSpWp]: Computing forward predicates...